Sperner's Lemma
Sperner's Lemma is a combinatorial result in topological combinatorics that asserts the existence of a fully labeled simplex in any proper labeling of a triangulated simplex, thereby providing a discrete analog of the Brouwer fixed-point theorem.
69
Publications
2.5K
Citations
90
Authors
58
Institutions
Publications per year
2017–2026
3
Parents
69
Rental Harmony: Sperner's Lemma in Fair Division
Francis Edward Su · American Mathematical Monthly · 1999 · 256 citations
Some Combinatorial Lemmas in Topology
Harold W. Kuhn · IBM Journal of Research and Development · 1960 · 195 citations
Rental Harmony: Sperner's Lemma in Fair Division
Francis Edward Su · American Mathematical Monthly · 1999 · 194 citations
1–5 of 69
90
5
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 90
58
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
10 publications
456 citations

University of Rostock
Rostock, Germany
3 h-index
3 publications
40 citations
University of South Carolina
Columbia, United States
3 h-index
6 publications
137 citations

Eötvös Loránd University
Budapest, Hungary
3 h-index
4 publications
128 citations
University of California, Riverside
Riverside, United States
2 h-index
2 publications
41 citations
California Institute of Technology
Pasadena, United States
2 h-index
3 publications
106 citations

Hungarian Academy of Sciences
Budapest, Hungary
2 h-index
4 publications
68 citations
University of California, Los Angeles
Los Angeles, United States
2 h-index
3 publications
85 citations
1–8 of 58
14 publications · 582 citations
13
h-index
4 publications · 509 citations
4
h-index
4 publications · 66 citations
4
h-index
3 publications · 77 citations
3
h-index
3 publications · 59 citations
3
h-index
1–5