Ideal 0, 1 matrices - MaRDI portal

polyhedron ideal clutter ideal matrix width-length inequality \(0, 1\) matrix Berge's strong perfect graph conjecture max flow min cut property minimally nonideal circulants minor minimal nonideal matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Cited In (53)

Intersecting and dense restrictions of clutters in polynomial time
Dominating set games.
Idealness of k-wise Intersecting Families
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,\pm 1)\) ideal matrices
Clean Clutters and Dyadic Fractional Packings
Idealness of \(k\)-wise intersecting families
Lehman's forbidden minor characterization of ideal 0-1 matrices
The nonidealness index of rank-ideal matrices
Intersecting restrictions in clutters
Circuits and circulant minors
On the set covering polyhedron of circulant matrices
Clean tangled clutters, simplices, and projective geometries
An extension of Lehman's theorem and ideal set functions
Generalized minor inequalities for the set covering polyhedron related to circulant matrices
On ideal clutters, metrics and multiflows
On the mixed set covering, packing and partitioning polytope
On Packing Dijoins in Digraphs and Weighted Digraphs
Vertex adjacencies in the set covering polyhedron
A new infinite family of minimally nonideal matrices
On the behavior of the \(N_{+}\)-operator under blocker duality
Ideal clutters
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
On dominating set polyhedra of circular interval graphs
The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs
A catalog of minimally nonideal matrices
Resistant Sets in the Unit Hypercube
Deltas, extended odd holes and their blockers
Lift-and-project ranks of the set covering polytope of circulant matrices
A characterization of weakly bipartite graphs
Applying Lehman's theorems to packing problems
A new infinite class of ideal minimally non-packing clutters
On circulant thin Lehman matrices
Intersecting and dense restrictions of clutters in polynomial time
Delta Minors, Delta Free Clutters, and Entanglement
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
(0, ±1) ideal matrices
Row family inequalities for the set covering polyhedron
On combinatorial properties of binary spaces
Title not available (Why is that?)
Cuboids, a class of clutters
Perfect \(0,\pm 1\) matrices

   Recommendations

\((0,\pm 1)\) ideal matrices 👍 👎
(0, ±1) ideal matrices 👍 👎
Lehman's forbidden minor characterization of ideal 0-1 matrices 👍 👎

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)