Non-regular square bipartite designs
From MaRDI portal
Publication:1601620
DOI10.1016/S0024-3795(01)00570-5zbMath0998.15021MaRDI QIDQ1601620
Caterina De Simone, Paolo Nobili, Grigor Gasparyan
Publication date: 27 June 2002
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrix equations and identities (15A24) Other designs, configurations (05B30) Matrices of integers (15B36)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lehman's forbidden minor characterization of ideal 0-1 matrices
- Combinatorial designs related to the strong perfect graph conjecture
- Imperfect and nonideal clutters: A common approach
- Applying Lehman's theorems to packing problems
- Minimal imperfect graphs: A simple approach
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- Combinatorial designs and related systems
- A characterization of perfect graphs
- On the width—length inequality
- Bipartite \((d,\lambda)\)-designs
This page was built for publication: Non-regular square bipartite designs