On Haber's minimum term rank formula

DOI10.1016/S0195-6698(81)80016-9zbMath0463.05019OpenAlexW1995648919MaRDI QIDQ1153088

Richard A. Brualdi

Publication date: 1981

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(81)80016-9

zbMATH Keywords

term rank(0,1)-matrices

Mathematics Subject Classification ID

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

Related Items (4)

The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence ⋮ Matrices of zeros and ones with fixed row and column sum vectors ⋮ On \(\mathfrak A(R,S)\) all of whose members are indecomposable ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• Unnamed Item
• Unnamed Item
• Term rank of \(0,1\) matrices
• On Ryser's maximum term rank formula
• Transversal theory. An account of some aspects of combinatorial mathematics
• Minimal Term Rank of a Class of (0, 1)-Matrices
• Traces of Matrices of Zeros and Ones

This page was built for publication: On Haber's minimum term rank formula