A theorem in combinatorial matrix theory
From MaRDI portal
Publication:1138062
DOI10.1016/0024-3795(80)90255-4zbMath0431.15012MaRDI QIDQ1138062
Publication date: 1980
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(80)90255-4
Related Items
Combinatorial analysis (nonnegative matrices, algorithmic problems), An application of Ryser's (x,y)-theorem to a problem in statistics, Matrices and set intersections
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(\lambda\)-designs
- A theorem on block designs
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- A characterization of symmetric block designs
- Block designs with repeated blocks
- Modular Hadamard matrices and related designs
- Some results on λ-designs
- Square λ-Linked Designs
- A Fundamental Matrix Equation for Finite Sets