Term rank of \(0,1\) matrices

zbMath0100.01901MaRDI QIDQ774036

Robert Morton Haber

Publication date: 1960

Published in: Rendiconti del Seminario Matematico della Università di Padova (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RSMUP_1960__30__24_0

zbMATH Keywords

combinatorics

Related Items

The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence, Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices, Reconstructing convex matrices by integer programming approaches, Matrices uniquely determined by their lonesums, Matrices of zeros and ones with fixed row and column sum vectors, On Haber's minimum term rank formula, Matrices of zeros and ones, Combinatorial aspects of rectangular non-negative matrices, Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings

Cites Work

• A theorem on flows in networks
• Combinatorial Properties of Matrices of Zeros and Ones
• The Term Rank of a Matrix
• Unnamed Item