Idealness of \(k\)-wise intersecting families
From MaRDI portal
Publication:2118114
DOI10.1007/s10107-020-01587-xzbMath1489.90215OpenAlexW3021119914MaRDI QIDQ2118114
Dabeen Lee, Tony Huynh, Ahmad Abdi, Cornuéjols, Gérard
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-020-01587-x
projective geometriesbinary cluttersideal clutterssums of circuits property\(k\)-wise intersecting families8-flow theoremquarter-integral packings
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial aspects of packing and covering (05B40)
Related Items
On Dyadic Fractional Packings of $T$-Joins, Clean Clutters and Dyadic Fractional Packings, Intersecting and dense restrictions of clutters in polynomial time
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of simple games
- Shortest coverings of graphs with cycles
- On the cycle polytope of a binary matroid
- Flows and generalized coloring theorems in graphs
- Matroids and multicommodity flows
- The matroids with the max-flow min-cut property
- Ideal 0, 1 matrices
- A characterization of weakly bipartite graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Cuboids, a class of clutters
- Identically self-blocking clutters
- Intersecting restrictions in clutters
- Clean tangled clutters, simplices, and projective geometries
- Combinatorial Optimization
- Integer Programming
- The Forbidden Minors of Binary Clutters
- A Minimax Theorem for Directed Graphs
- On the width-length inequality
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Idealness of k-wise Intersecting Families
- Ideal Clutters That Do Not Pack
- A Solution of the Shannon Switching Game
- On the algebraic theory of graph colorings
- Bottleneck extrema
- Balanced matrices
- Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids
- The packing property.
