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

Authors

90

  1. JR
    Jerrold R. Griggs

    University of South Carolina, United States

    5 publications · 97 citations

    5

    h-index

  2. GO
    Gyula O. H. Katona

    Hungarian Academy of Sciences, Hungary

    4 publications · 192 citations

    4

    h-index

  3. RM
    Robert M. Freund

    Massachusetts Institute of Technology, United States

    3 publications · 59 citations

    3

    h-index

  4. HO
    Hans-Dietrich O. F. Gronau

    University of Rostock, Germany

    3 publications · 38 citations

    3

    h-index

  5. FE
    Francis Edward Su

    Harvey Mudd College, United States

    3 publications · 499 citations

    3

    h-index

1–5 of 90

Venues

  1. Journal of Combinatorial Theory Series A

    14 publications · 582 citations

    13

    h-index

  2. American Mathematical Monthly

    4 publications · 509 citations

    4

    h-index

  3. European Journal of Combinatorics

    4 publications · 66 citations

    4

    h-index

  4. Discrete Mathematics

    3 publications · 77 citations

    3

    h-index

  5. Mathematics of Operations Research

    3 publications · 59 citations

    3

    h-index

1–5