On Haber's minimum term rank formula

DOI10.1016/S0195-6698(81)80016-9MaRDI QIDQ1153088zbMATH OpenOpenAlexFDO

Authors 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

(0,1)-matricesterm rank

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• Minimal Term Rank of a Class of (0, 1)-Matrices
• On Ryser's maximum term rank formula
• Term rank of 0,1 matrices
• Traces of Matrices of Zeros and Ones
• Transversal theory. An account of some aspects of combinatorial mathematics

Cited in

(4)

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

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

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