Sperner's lemma

E121351 UNEXPLORED

Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.

Observed surface forms (1)

Surface form	As subject	As object
Sperner’s lemma	0	1

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

Brouwer fixed-point theorem → hasCombinatorialVersion → Sperner's lemma →

Tucker’s lemma → relatedTo → Sperner's lemma →

this entity surface form: "Sperner’s lemma"