Cuboids, a class of clutters
DOI10.1016/J.JCTB.2019.10.002zbMATH Open1436.05023OpenAlexW2981903969MaRDI QIDQ1985449FDOQ1985449
Natália Guričanová, Ahmad Abdi, Dabeen Lee, Gérard Cornuéjols
Publication date: 7 April 2020
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: http://eprints.lse.ac.uk/102395/1/cuboids.pdf
packing propertycluttersideal clutters\(\tau =2\) conjecture\(f\)-flowing conjecturecuboidsgeneralized set covering inequalitiesideal minimally non-packing cluttersreplication conjecturesums of circuits property
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Decomposition of regular matroids
- Matching, Euler tours and the Chinese postman
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Solution of the Shannon Switching Game
- Bottleneck extrema
- A class of simple games
- Title not available (Why is that?)
- Polyhedral decompositions of cubic graphs
- Blocking and anti-blocking pairs of polyhedra
- A counterexample to a conjecture of Edmonds and Giles
- Matroids and multicommodity flows
- The matroids with the max-flow min-cut property
- Ideal 0, 1 matrices
- Combinatorial optimization. Packing and covering
- On the width—length inequality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Greedy algorithm and symmetric matroids
- On the cycle polytope of a binary matroid
- Integer Programming
- A generalization of max flow—min cut
- \((0,\pm 1)\) ideal matrices
- Perfect and ideal \(0, \pm 1\) matrices
- On combinatorial properties of binary spaces
- Ideal Clutters That Do Not Pack
- The packing property.
- Cropped cubes
- Title not available (Why is that?)
- On 2-partitionable clutters and the MFMC property
- A short proof of Seymour's characterization of the matroids with the max-flow min-cut property
Cited In (15)
- Idealness of k-wise Intersecting Families
- Testing idealness in the filter oracle model
- The max-flow min-cut property and \(\pm 1\)-resistant sets
- Idealness and 2-resistant sets
- Clean Clutters and Dyadic Fractional Packings
- Idealness of \(k\)-wise intersecting families
- Intersecting restrictions in clutters
- Clean tangled clutters, simplices, and projective geometries
- On Packing Dijoins in Digraphs and Weighted Digraphs
- Correction to: ``Idealness of \(k\)-wise intersecting families
- Total dual dyadicness and dyadic generating sets
- Resistant Sets in the Unit Hypercube
- cuboids-code
- A new infinite class of ideal minimally non-packing clutters
- Delta Minors, Delta Free Clutters, and Entanglement
Uses Software
Recommendations
This page was built for publication: Cuboids, a class of clutters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1985449)
