In mathematics, Sperner's lemma is a combinatorial result on colorings of triangulations, analogous to the Brouwer fixed point theorem, which is equivalent to it. It states that every Sperner coloring (described below) of a triangulation of an n {\displaystyle n} -dimensional simplex contains a cell whose vertices all have different colors.
In mathematics, Sperner's lemma is a combinatorial result on colorings of triangulations, analogous to the Brouwer fixed point theorem, which is equivalent to it. It states that every Sperner coloring (described below) of a triangulation of an n {\displaystyle n} -dimensional simplex contains a cell whose vertices all have different colors.
Source: Wikipedia "Sperner's lemma" · CC BY-SA 4.0
Share this article: X · Bluesky