Fulkerson–Chen–Anstee theorem

The Fulkerson–Chen–Anstee theorem is a result in graph theory, a branch of combinatorics. It provides one of two known approaches solving the digraph realization problem, i.e. it gives a necessary and sufficient condition for pairs of nonnegative integers [math]\displaystyle{ ((a_1,b_1),\ldots,(a_n,b_n)) }[/math] to be the indegree-outdegree pairs of a simple directed graph; a sequence obeying these conditions is called "digraphic". D. R. Fulkerson (1960) obtained a characterization analogous to the classical Erdős–Gallai theorem for graphs, but in contrast to this solution with exponentially many inequalities. In 1966 Chen improved this result in demanding the additional constraint that the integer pairs must be sorted in non-increasing lexicographical order leading to n inequalities. Anstee (1982) observed in a different context that it is sufficient to have [math]\displaystyle{ a_1\geq\cdots\geq a_n }[/math]. Berger reinvented this result and gives a direct proof.

Statement

A sequence [math]\displaystyle{ ((a_1,b_1 ),\ldots,(a_n,b_n)) }[/math] of nonnegative integer pairs with [math]\displaystyle{ a_1\geq\cdots\geq a_n }[/math] is digraphic if and only if [math]\displaystyle{ \sum_{i=1}^{n}a_i=\sum_{i=1}^{n}b_i }[/math] and the following inequality holds for k such that [math]\displaystyle{ 1 \leq k \leq n }[/math]:

[math]\displaystyle{ \sum^k_{i=1} a_i\leq \sum^k_{i=1} \min(b_i,k-1)+ \sum^n_{i=k+1} \min(b_i,k) }[/math]

Stronger versions

Berger proved that it suffices to consider the [math]\displaystyle{ k }[/math]th inequality such that [math]\displaystyle{ 1 \leq k \lt n }[/math] with [math]\displaystyle{ a_k \gt a_{k+1} }[/math] and for [math]\displaystyle{ k = n }[/math].

Other notations

The theorem can also be stated in terms of zero-one matrices. The connection can be seen if one realizes that each directed graph has an adjacency matrix where the column sums and row sums correspond to [math]\displaystyle{ (a_1,\ldots,a_n) }[/math] and [math]\displaystyle{ (b_1,\ldots,b_n) }[/math]. Note that the diagonal of the matrix only contains zeros. There is a connection to the relation majorization. We define a sequence [math]\displaystyle{ (a^*_1,\ldots,a^*_n) }[/math] with [math]\displaystyle{ a^*_k:=|\{b_i|i\gt k, b_i \geq k\}| + |\{b_i|i \leq k, b_i \geq k-1\}| }[/math]. Sequence [math]\displaystyle{ (a^*_1,\ldots,a^*_n) }[/math] can also be determined by a corrected Ferrers diagram. Consider sequences [math]\displaystyle{ (a_1,\ldots,a_n) }[/math], [math]\displaystyle{ (b_1,\ldots,b_n) }[/math] and [math]\displaystyle{ (a^*_1,\ldots,a^*_n) }[/math] as [math]\displaystyle{ n }[/math]-dimensional vectors [math]\displaystyle{ a }[/math], [math]\displaystyle{ b }[/math] and [math]\displaystyle{ a^* }[/math]. Since [math]\displaystyle{ \sum_{i=1}^k a^*_i = \sum^k_{i=1} \min(b_i,k-1)+ \sum^n_{i=k+1} \min(b_i,k) }[/math] by applying the principle of double counting, the theorem above states that a pair of nonnegative integer sequences [math]\displaystyle{ (a,b) }[/math] with nonincreasing [math]\displaystyle{ a }[/math] is digraphic if and only if vector [math]\displaystyle{ a^* }[/math] majorizes [math]\displaystyle{ a }[/math].

Generalization

A sequence [math]\displaystyle{ ((a_1,b_1 ),\ldots,(a_n,b_n)) }[/math] of nonnegative integer pairs with [math]\displaystyle{ a_1\geq\cdots\geq a_n }[/math] is digraphic if and only if [math]\displaystyle{ \sum_{i=1}^{n}a_i=\sum_{i=1}^{n}b_i }[/math] and there exists a sequence [math]\displaystyle{ c }[/math] such that the pair [math]\displaystyle{ (c,b) }[/math] is digraphic and [math]\displaystyle{ c }[/math] majorizes [math]\displaystyle{ a }[/math].

Characterizations for similar problems

Similar theorems describe the degree sequences of simple graphs, simple directed graphs with loops, and simple bipartite graphs. The first problem is characterized by the Erdős–Gallai theorem. The latter two cases, which are equivalent see Berger, are characterized by the Gale–Ryser theorem.

See also

• Kleitman–Wang algorithms