A sparse colorful polytopal KKM theorem
DOI10.1007/s00454-022-00464-yarXiv2112.14421OpenAlexW4311309989MaRDI QIDQ6204766
Publication date: 2 April 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.14421
(n)-dimensional polytopes (52B11) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Hypergraphs (05C65) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15) Helly-type theorems and geometric transversal theory (52A35) Density (toughness, etc.) (05C42)
Cites Work
- Unnamed Item
- Fractional covers and matchings in families of weighted \(d\)-intervals
- Equilibrium in a discrete exchange economy with money
- The intersection of a matroid and an oriented matroid
- Dividing a cake fairly
- A generalization of Caratheodory's theorem
- Maximum degree and fractional matchings in uniform hypergraphs
- Combinatorial formulae for multiple set-valued labellings
- A simple proof of K-K-M-S theorem
- Transversals of \(d\)-intervals
- Transversals of 2-intervals, a topological approach
- Fair division with multiple pieces
- Colorful coverings of polytopes and piercing numbers of colorful \(d\)-intervals
- How to Cut a Cake Fairly
- Robust Tverberg and Colourful Carathéodory Results via Random Choice
- Fair distributions for more participants than allocations
- Lower bounds on the transversal numbers of \(d\)-intervals
This page was built for publication: A sparse colorful polytopal KKM theorem
