Depth of (0,1)-matrices with the same row and same column sums

DOI10.1007/BF01140356MaRDI QIDQ793032zbMATH OpenOpenAlexFDO

Authors V. E. Tarakanov

Publication date 1983

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01140356

zbMATH Keywords

(0,1)-matricescovering a finite setmaximal depth

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of packing and covering (05B40)

Review text

Translation from Mat. Zametki 34, No.3, 463-476 (Russian) (1983; Zbl 0527.05016).

Cites work

• A general upper bound for 1-widths
• scientific article; zbMATH DE number 3726376 (Why is no real title available?)
• scientific article; zbMATH DE number 3728277 (Why is no real title available?)
• Multiplicities and Minimal Widths for (0, 1)-Matrices
• The 1-width of (0,1)-matrices having constant row sum 3
• The size of connected hypergraphs with prescribed covering number

This page was built for publication: Depth of (0,1)-matrices with the same row and same column sums

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