Sperner's lemma
(重定向自Sperner lemma)



In mathematics, Sperner's lemma is a combinatorial analog of the Brouwer fixed point theorem, which is equivalent to it.
Sperner's lemma states that every Sperner coloring (described below) of a triangulation of an n-dimensional simplex contains a cell colored with a complete set of colors.