Lehman's forbidden minor characterization of ideal 0-1 matrices

DOI10.1016/0012-365X(93)90178-VzbMath0798.05010MaRDI QIDQ686505

Manfred W. Padberg

Publication date: 20 December 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

ideal matriceszero-one matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrices over special rings (quaternions, finite fields, etc.) (15B33)

Related Items (17)

A note on clutter partitions ⋮ Subsets of a finite set that almost always intersect each other in \(\lambda\) elements ⋮ Applying Lehman's theorems to packing problems ⋮ On the mixed set covering, packing and partitioning polytope ⋮ A characterization of knapsacks with the max-flow--min-cut property ⋮ Some insight into characterizations of minimally nonideal matrices ⋮ Ideal clutters ⋮ A class of polynomially solvable 0-1 programming problems and an application ⋮ On a certain class of nonideal clutters ⋮ The nonidealness index of rank-ideal matrices ⋮ Efficient solutions for special zero-one programming problems ⋮ On the set covering polyhedron of circulant matrices ⋮ Unnamed Item ⋮ A catalog of minimally nonideal matrices ⋮ A characterization of weakly bipartite graphs ⋮ A short proof of Guenin's characterization of weakly bipartite graphs ⋮ Non-regular square bipartite designs

Cites Work

• Almost integral polyhedra related to certain combinatorial optimization problems
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• Normal hypergraphs and the perfect graph conjecture
• On the width—length inequality
• Perfect zero–one matrices
• Blocking and anti-blocking pairs of polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lehman's forbidden minor characterization of ideal 0-1 matrices