The Borsuk-Ulam Theorem in Combinatorics
I.J. Jaspers (TU Delft - Electrical Engineering, Mathematics and Computer Science)
D.C. Gijswijt – Mentor
KP Hart – Graduation committee member
J.G. Spandaw – Graduation committee member
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
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.