4
$\begingroup$

I'm looking for a proof that Brouwer's fixed point theorem implies Sperner's lemma. All proof I've found just prove that there must be at least one completely colored n-simplex, not that there must be an odd number of them.

Thanks in advance!

  • 0
    Thanks for all your helpful comments!2012-07-29

0 Answers 0