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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2017
01219792017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The Sperner and Tucker lemmas are combinatorial analogous of the Brouwer and Borsuk Ulam theorems with many useful applications… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
We show that Fan’s 1952 lemma on labelled triangulations of the n-sphere with n + 1 labels is equivalent to the Borsuk–Ulam… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
We develop a geometric framework that unifies several different combinatorial fixed-point theorems related to Tucker’s lemma and… (More)
Is this relevant?
2009
2009
Tucker’s lemma states that if we triangulate the unit disc centered at the origin and color the vertices with {1,−1, 2,−2} in an… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2009
2009
We give a new, combinatorial proof for the necklace splitting problem for two thieves using only Tucker's lemma (a combinatorial… (More)
Is this relevant?
2008
2008
Part II of this study uses the path-following theory of labelled V-complexes developed in Part I to provide constructive… (More)
  • figure 1
  • figure 2
Is this relevant?
2005
2005
We present a constructive proof of Ky Fan’s combinatorial lemma concerning labellings of triangulated spheres. Our construction… (More)
  • figure 1
  • figure 2
Is this relevant?
2004
2004
Kneser's conjecture, rst proved by Lovv asz in 1978, states that the graph with all k-element subsets of f1; 2; : : : ; ng as… (More)
Is this relevant?
1991
1991
Chapter 36 Decomposing Graphs into Regions of Small Diameter* Nathan Linialt Michael %.lss~ A decomposition of a graph G = (V, E… (More)
Is this relevant?
1979
1979
Tucker’s Lemma is a combinatorial result which can be used to prove many antipodal-point theorems for the n-sphere, such as the… (More)
Is this relevant?