sperner's lemma

/S P ER0 N ER0 EH0 S L EH0 M AH0/
noun
  1. 1

    (mathematics) A combinatorial analog of the Brouwer fixed-point theorem, stating that every Sperner coloring of a triangulation of an n-dimensional simplex contains a cell colored with a complete set of colors.

Translate “sperner's lemma” into another language