Properties of a Class of (0,1)-Matrices Covering a given Matrix

DOI10.4153/CJM-1982-029-3zbMath0442.05012OpenAlexW2334698612MaRDI QIDQ3884120

Richard P. Anstee

Publication date: 1982

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1982-029-3

zbMATH Keywords

Gale-Ryser theorem(0,1)-matrix rule of Ford and Fulkersongeneralization of the interchange theoremmatrices with zero tracetheorem of Fulkerson

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Related Items (16)

The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence ⋮ Leaf realization problem, caterpillar graphs and prefix normal words ⋮ The structure matrix and a generalization of Ryser's maximum term rank formula ⋮ Binary vectors partially determined by linear equation systems ⋮ Sufficient Conditions for Graphicality of Bidegree Sequences ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ Triangular (0,1)-matrices with prescribed row and column sums ⋮ Efficiently Realizing Interval Sequences ⋮ Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros ⋮ Integral matrices with given row and column sums ⋮ An algorithm for finding the number of (0, 1, 2,…, l)-matrices with prefixed row sum and column sum vectors ⋮ Bidimensional allocation of seats via zero-one matrices with given line sums ⋮ On the upper bound of the diameter of interchange graphs ⋮ The network flows approach for matrices with given row and column sums ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems) ⋮ Relaxed and approximate graph realizations

This page was built for publication: Properties of a Class of (0,1)-Matrices Covering a given Matrix