Recommendations
Cited in
(54)- Some insight into characterizations of minimally nonideal matrices
- Resistant sets in the unit hypercube
- Dominating set games.
- Notes on ``Ideal 0, 1 matrices by Cornuéjols and Novick
- Testing idealness in the filter oracle model
- The max-flow min-cut property and \(\pm 1\)-resistant sets
- Structure of cubic Lehman matrices
- Perfect, ideal and balanced matrices
- Null Ideals of Matrices
- (0, 1) ideal matrices
- Lehman's forbidden minor characterization of ideal 0-1 matrices
- Idealness of \(k\)-wise intersecting families
- The nonidealness index of rank-ideal matrices
- Intersecting restrictions in clutters
- \((0, \pm 1)\) ideal matrices
- Circuits and circulant minors
- On the set covering polyhedron of circulant matrices
- An extension of Lehman's theorem and ideal set functions
- Generalized minor inequalities for the set covering polyhedron related to circulant matrices
- Clean tangled clutters, simplices, and projective geometries
- On the mixed set covering, packing and partitioning polytope
- Vertex adjacencies in the set covering polyhedron
- On ideal clutters, metrics and multiflows
- On Packing Dijoins in Digraphs and Weighted Digraphs
- A new infinite family of minimally nonideal matrices
- On the behavior of the \(N_{+}\)-operator under blocker duality
- Ideal clutters
- Delta minors, delta free clutters, and entanglement
- On the dominating set polytope of web graphs
- Perfect and ideal \(0, \pm 1\) matrices
- On packing and covering polyhedra of consecutive ones circulant clutters
- Intersecting and dense restrictions of clutters in polynomial time
- Idealness of \(k\)-wise intersecting families
- On dominating set polyhedra of circular interval graphs
- A catalog of minimally nonideal matrices
- The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs
- Deltas, extended odd holes and their blockers
- Clean clutters and dyadic fractional packings
- Lift-and-project ranks of the set covering polytope of circulant matrices
- A characterization of weakly bipartite graphs
- On circulant thin Lehman matrices
- Applying Lehman's theorems to packing problems
- A new infinite class of ideal minimally non-packing clutters
- Intersecting and dense restrictions of clutters in polynomial time
- Thin Lehman matrices arising from finite groups
- The minor inequalities in the description of the set covering polyhedron of circulant matrices
- The nonidealness index of circulant matrices
- Some advances on the set covering polyhedron of circulant matrices
- Arithmetic relations in the set covering polyhedron of circulant clutters
- Row family inequalities for the set covering polyhedron
- On combinatorial properties of binary spaces
- Perfect \(0,\pm 1\) matrices
- scientific article; zbMATH DE number 1409230 (Why is no real title available?)
- Cuboids, a class of clutters
This page was built for publication: Ideal 0, 1 matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322011)
