A constructive proof of Tucker's combinatorial lemma
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3063670 (Why is no real title available?)
- scientific article; zbMATH DE number 3102257 (Why is no real title available?)
- A New and Constructive Proof of the Borsuk-Ulam Theorem
- A constructive proof of Tucker's combinatorial lemma
- A variable-dimension simplicial algorithm for antipodal fixed-point theorems
- Borsuk's theorem through complementary pivoting
- Extensions of Lemke's algorithm for the linear complementarity problem
- On the combinatorial antipodal-point lemmas
Cited in
(18)- A constructive proof of Ky Fan's generalization of Tucker's lemma
- Combinatorial integer labeling theorems on finite sets with applications
- Solving discrete zero point problems
- Short proofs of the Kneser-Lovász coloring principle
- 2-D Tucker is PPA complete
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- Proving Tucker's lemma with a volume argument
- On the complexity of the parity argument and other inefficient proofs of existence
- A variable-dimension simplicial algorithm for antipodal fixed-point theorems
- A combinatorial proof for the circular chromatic number of Kneser graphs
- Low diameter graph decompositions
- On the existence and approximation of zeroes
- The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Solving discrete systems of nonlinear equations
- A constructive proof of Tucker's combinatorial lemma
- A combinatorial analog of a theorem of F.J. Dyson
This page was built for publication: A constructive proof of Tucker's combinatorial lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1153158)
