The Borsuk-Ulam Theorem in Combinatorics
More Info
expand_more
expand_more
Abstract
We examine and prove the Borsuk-Ulam theorem and its combinatorial equivalent Fan's lemma. The theory of simplicial complexes and triangulations plays an important role in this. The Borsuk-Ulam theorem and Fan's lemma will be used to provide proofs for the Brouwer fixed point theorem and the combinatorial Sperner's lemma. Lastly the Borsuk-Ulam theorem will be applied in determining the chromatic number of Kneser graphs.
Files
Ilja_Jaspers_The_Borsuk_Ulam_T... (pdf)
(pdf | 0.332 Mb)