Realizing degree imbalances in directed graphs (Q5946755)

In a digraph, the imbalance of a vertex \(v\) with out-degree \(d^+(v)\) and in-degree \(d^-(v)\) is \(d^+(v)-d^-(v)\). The imbalance sequences of digraphs are characterized (an analogy of the Havel-Hakimi theorem is given). Besides an algorithmic proof the authors present also two other proofs. For a realizable sequence their greedy algorithm produces a digraph with the fewest arcs. Also the maximum number of arcs is determined for a realization without opposed arcs.