On circulant thin Lehman matrices
From MaRDI portal
Publication:484160
DOI10.1007/s10801-014-0514-9zbMath1304.05012OpenAlexW2050684711MaRDI QIDQ484160
Hidehiro Shinohara, Tadashi Sakuma
Publication date: 18 December 2014
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-014-0514-9
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Thin Lehman matrices and their graphs
- A new infinite family of minimally nonideal matrices
- Thin Lehman matrices arising from finite groups
- On circular critical graphs
- The strong perfect graph theorem
- Lehman matrices
- A catalog of minimally nonideal matrices
- Ideal 0, 1 matrices
- Imperfect and nonideal clutters: A common approach
- Applying Lehman's theorems to packing problems
- Grinstead's conjecture is true for graphs with a small clique number
- Combinatorial designs and related systems
- Combinatorial Optimization
- On the width—length inequality
- The Forbidden Minors of Binary Clutters
- Perfect zero–one matrices
- Blocking and anti-blocking pairs of polyhedra