Skip to search formSkip to main contentSkip to account menu

Tucker's lemma

In mathematics, Tucker's lemma is a combinatorial analog of the Borsuk–Ulam theorem, named after Albert W. Tucker. Let T be a triangulation of the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Borsuk–Ulam theoremBrouwer fixed-point theoremKy Fan lemmaPPA (complexity)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Proving Tucker's Lemma with a Volume Argument
Sperner's lemma is a statement about labeled triangulations of a simplex. McLennan and Tourky (2007) provided a novel proof of… 
2015
2015
Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology
Part II of this study uses the path-following theory of labelled V-complexes developed in Part I to provide constructive… 
2015
2015
Variable Dimension Complexes Part I: Basic Theory
Over the past several years, much attention in the field of simplicial pivoting algorithms has been focused on the new class of… 
2013
2013
A Borsuk–Ulam Equivalent that Directly Implies Sperner's Lemma
Abstract We show that Fan's 1952 lemma on labelled triangulations of the n-sphere with n + 1 labels is equivalent to the Borsuk… 
2012
2012
Extensions of Sperner and Tucker's lemma for manifolds
2009
2009
Combinatorial Necklace Splitting
We give a new, combinatorial proof for the necklace splitting problem for two thieves using only Tucker's lemma (a combinatorial… 
2008
2008
Discrete Splittings of the Necklace
This paper deals with direct proofs and combinatorial proofs of the famous necklace theorem of Alon, Goldberg, and West. The new… 
2008
2008
C. 3i Working Paper Alfred P. Sloan School of Management a Unified Approach to Some Combinatorial Lemmas in Topology a Unified Approach to Some Combinatorial Lemmas in Topology
Part II of this study uses the path-following theory of labelled V-complexes developed in Part I to provide constructive… 
1974
1974
Topologic Proofs of Some Combinatorial Theorems
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)