Pages that link to "Item:Q686505"
From MaRDI portal
The following pages link to Lehman's forbidden minor characterization of ideal 0-1 matrices (Q686505):
Displaying 20 items.
- A class of polynomially solvable 0-1 programming problems and an application (Q547367) (← links)
- Ideal clutters (Q697573) (← links)
- The nonidealness index of rank-ideal matrices (Q987680) (← links)
- Efficient solutions for special zero-one programming problems (Q995926) (← links)
- On the set covering polyhedron of circulant matrices (Q1015320) (← links)
- A characterization of knapsacks with the max-flow--min-cut property (Q1197887) (← links)
- A catalog of minimally nonideal matrices (Q1298742) (← links)
- Ideal 0, 1 matrices (Q1322011) (← links)
- A note on clutter partitions (Q1332941) (← links)
- Subsets of a finite set that almost always intersect each other in \(\lambda\) elements (Q1356776) (← links)
- \((0,\pm 1)\) ideal matrices (Q1380940) (← links)
- Non-regular square bipartite designs (Q1601620) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- A characterization of weakly bipartite graphs (Q1850558) (← links)
- A short proof of Guenin's characterization of weakly bipartite graphs (Q1850611) (← links)
- Applying Lehman's theorems to packing problems (Q1919808) (← links)
- Structure of cubic Lehman matrices (Q2325755) (← links)
- Some insight into characterizations of minimally nonideal matrices (Q2483016) (← links)
- On a certain class of nonideal clutters (Q2500534) (← links)
- (Q5708482) (← links)