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

DOI10.4153/CJM-1982-029-3MaRDI QIDQ3884120zbMATH OpenOpenAlexFDO

Authors R. 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

(0,1)-matrix rule of Ford and FulkersonGale-Ryser theoremgeneralization of the interchange theoremmatrices with zero tracetheorem of Fulkerson

Mathematics Subject Classification ID

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

Cited in

(18)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3884120)