Sperner's lemma: proofs and applications
Kevin O'Neill


Sperner's lemma is a combinatorial result regarding labelled triangulations of n-simplices, which under certain conditions, guarantees the existence of a fully-labelled simplex. In this talk, I will present a few proofs of the lemma and show how it may be used to construct an elementary proof of the Brouwer fixed point theorem.