Sperner's lemma

Triangulate a triangle and label every vertex by $1$, $2$, or $3$, forbidding label $i$ on the side opposite vertex $i$. Then the number of small triangles carrying all three labels is odd, and in particular at least one such triangle exists. Counting edges whose endpoint labels are $1$ and $2$ proves the parity statement: boundary incidences are odd, while a small triangle has odd incidence exactly when it has all three labels.