Proving Tucker’s Lemma with a volume argument
From MaRDI portal
Publication:2979657
DOI10.1090/conm/685/13753zbMath1360.05020arXiv1604.02395OpenAlexW2342051555MaRDI QIDQ2979657
Mutiara Sondjaja, Beauttie Kuture, Francis Edward Su, Christopher Loa, Oscar Leong
Publication date: 25 April 2017
Published in: Algebraic and Geometric Methods in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.02395
Enumerative combinatorics (05A99) Fixed points and coincidences in algebraic topology (55M20) Combinatorial geometries and geometric closure systems (51D20)
Cites Work
- Unnamed Item
- Unnamed Item
- Using volume to prove Sperner's Lemma
- A constructive proof of Tucker's combinatorial lemma
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- A constructive proof of Ky Fan's generalization of Tucker's lemma
- Non-cooperative games
- Rental Harmony: Sperner's Lemma in Fair Division
- Discrete Splittings of the Necklace
- A combinatorial proof of Tucker's lemma for the n-cube
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
This page was built for publication: Proving Tucker’s Lemma with a volume argument