A constructive proof of Tucker's combinatorial lemma
From MaRDI portal
Publication:1153158
DOI10.1016/0097-3165(81)90027-3zbMath0462.05026OpenAlexW2036062917WikidataQ56039177 ScholiaQ56039177MaRDI QIDQ1153158
Michael J. Todd, Robert M. Freund
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(81)90027-3
Related Items
On the complexity of the parity argument and other inefficient proofs of existence, Short proofs of the Kneser-Lovász coloring principle, A combinatorial proof for the circular chromatic number of Kneser graphs, A constructive proof of Tucker's combinatorial lemma, Solving discrete systems of nonlinear equations, Proving Tucker’s Lemma with a volume argument, On the existence and approximation of zeroes, Combinatorial integer labeling theorems on finite sets with applications, 2-D Tucker is PPA complete, A combinatorial analog of a theorem of F.J. Dyson, Solving discrete zero point problems, The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics, Consensus-halving via theorems of Borsuk-Ulam and Tucker, A variable-dimension simplicial algorithm for antipodal fixed-point theorems, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, A constructive proof of Ky Fan's generalization of Tucker's lemma, The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich, Low diameter graph decompositions
Cites Work
- Unnamed Item
- Unnamed Item
- On the combinatorial antipodal-point lemmas
- A constructive proof of Tucker's combinatorial lemma
- Extensions of Lemke's algorithm for the linear complementarity problem
- Borsuk's theorem through complementary pivoting
- A variable-dimension simplicial algorithm for antipodal fixed-point theorems
- A New and Constructive Proof of the Borsuk-Ulam Theorem
