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

DOI10.1007/BF01140356zbMATH Open0538.05018OpenAlexW2052887385MaRDI QIDQ793032FDOQ793032

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)

Cites Work

• Multiplicities and Minimal Widths for (0, 1)-Matrices
• The size of connected hypergraphs with prescribed covering number
• A general upper bound for 1-widths
• The 1-width of (0,1)-matrices having constant row sum 3
• Title not available (Why is that?)
• Title not available (Why is that?)

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)