A general upper bound for 1-widths

DOI10.1016/0097-3165(75)90018-7zbMath0299.05019OpenAlexW1971347018MaRDI QIDQ1214935

Richard A. Dean, James R. Henderson

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(75)90018-7

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Miscellaneous inequalities involving matrices (15A45)

Related Items (2)

Matrices of zeros and ones with fixed row and column sum vectors ⋮ Depth of (0,1)-matrices with the same row and same column sums

Cites Work

• The 1-width of (0,1)-matrices having constant row sum 3
• Two combinatorial covering theorems
• MAXIMAL DEPTH OF A CLASS OF $ (0,1)$-MATRICES
• On a Problem of Additive Number Theory

This page was built for publication: A general upper bound for 1-widths