Lehman's forbidden minor characterization of ideal 0-1 matrices
From MaRDI portal
Publication:686505
Recommendations
Cites work
- scientific article; zbMATH DE number 3495859 (Why is no real title available?)
- scientific article; zbMATH DE number 3513556 (Why is no real title available?)
- scientific article; zbMATH DE number 3628968 (Why is no real title available?)
- Almost integral polyhedra related to certain combinatorial optimization problems
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- Blocking and anti-blocking pairs of polyhedra
- Normal hypergraphs and the perfect graph conjecture
- On the width—length inequality
- Perfect zero–one matrices
Cited in
(20)- On the set covering polyhedron of circulant matrices
- Structure of cubic Lehman matrices
- A note on clutter partitions
- A characterization of weakly bipartite graphs
- A characterization of knapsacks with the max-flow--min-cut property
- The nonidealness index of rank-ideal matrices
- A class of polynomially solvable 0-1 programming problems and an application
- Efficient solutions for special zero-one programming problems
- Minimal nonnegative integral matrices and uniquely determined (0,1)-matrices
- Subsets of a finite set that almost always intersect each other in \(\lambda\) elements
- scientific article; zbMATH DE number 2230198 (Why is no real title available?)
- Some insight into characterizations of minimally nonideal matrices
- Applying Lehman's theorems to packing problems
- A catalog of minimally nonideal matrices
- Non-regular square bipartite designs
- On a certain class of nonideal clutters
- A short proof of Guenin's characterization of weakly bipartite graphs
- Ideal clutters
- \((0, \pm 1)\) ideal matrices
- On the mixed set covering, packing and partitioning polytope
This page was built for publication: Lehman's forbidden minor characterization of ideal 0-1 matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686505)
