The two Sperner's lemmas are both combinatorial in nature. One of them (from 1932) is a step in a direct proof of the Brouwer fixed-point theorem without explicit use of homology.
The other (1927) concerns possible anti-chains in the power set of {1,2, ..., n}, giving the largest possible size being that attained by the 'middle' sets (the central binomial coefficient(s)). It can be reduced to the Hall marriage theorem.