Idealness of k-wise Intersecting Families
From MaRDI portal
Publication:5041730
DOI10.1007/978-3-030-45771-6_1zbMath1504.05049arXiv1912.00614OpenAlexW3132213263MaRDI QIDQ5041730
Cornuéjols, Gérard, Tony Huynh, Ahmad Abdi, Dabeen Lee
Publication date: 14 October 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.00614
Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40)
Related Items (5)
On Dyadic Fractional Packings of $T$-Joins ⋮ Clean tangled clutters, simplices, and projective geometries ⋮ A new infinite class of ideal minimally non-packing clutters ⋮ Idealness of \(k\)-wise intersecting families ⋮ Correction to: ``Idealness of \(k\)-wise intersecting families
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of simple games
- Shortest coverings of graphs with cycles
- 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
- The Forbidden Minors of Binary Clutters
- A Minimax Theorem for Directed Graphs
- On the width-length inequality
- Ideal Clutters That Do Not Pack
- A Solution of the Shannon Switching Game
- On the algebraic theory of graph colorings
- Bottleneck extrema
- The packing property.
This page was built for publication: Idealness of k-wise Intersecting Families