Pages that link to "Item:Q1153158"

The following pages link to A constructive proof of Tucker's combinatorial lemma (Q1153158):

Displaying 18 items.

• A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
• Solving discrete systems of nonlinear equations (Q635151) (← links)
• Combinatorial integer labeling theorems on finite sets with applications (Q963665) (← links)
• A combinatorial analog of a theorem of F.J. Dyson (Q975232) (← links)
• A constructive proof of Tucker's combinatorial lemma (Q1153158) (← links)
• Low diameter graph decompositions (Q1316650) (← links)
• On the complexity of the parity argument and other inefficient proofs of existence (Q1329155) (← links)
• Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
• Consensus-halving via theorems of Borsuk-Ulam and Tucker (Q1810715) (← links)
• 2-D Tucker is PPA complete (Q2009648) (← links)
• Solving discrete zero point problems (Q2494512) (← links)
• The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics (Q2497969) (← links)
• A constructive proof of Ky Fan's generalization of Tucker's lemma (Q2566806) (← links)
• Proving Tucker’s Lemma with a volume argument (Q2979657) (← links)
• On the existence and approximation of zeroes (Q3319694) (← links)
• A variable-dimension simplicial algorithm for antipodal fixed-point theorems (Q3906317) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)