Doubly stochastic matrices and dicycle covers and packings in eulerian digraphs Original Research Article

Mirsky (1963) raised the question of characterizing Ω0n, the convex hull of the nonidentity permutation matrices of order n, by a set of linear constraints. Cruse (1979) solved Mirskyʹs problem by presenting an implicit description of those constraints. We associate an eulerian digraph with each doubly stochastic matrix, and then restate Cruseʹs characterization of the polytope Ω0n in terms of dicycle covers of these digraphs. Brualdi and Hwang (1992) have shown, by using Cruseʹs characterization and a result of Dridi (1980), an explicit set of linear inequalities that characterize Ω0n for n less-than-or-equals, slant 6. By using our characterization of Ω0n, we show that their result is valid if and only if n less-than-or-equals, slant 6. We show as well that if D is an eulerian digraph on n less-than-or-equals, slant 6 nodes, then there is always a minimum dicycle cover which is integral. We apply this last result and a result of Seymour (1994) to derive a min-max relation for eulerian digraphs on n less-than-or-equals, slant 6 nodes.