On the Sperner lemma
From MaRDI portal
Cited in
(21)- A constructive proof of a permutation-based generalization of Sperner's lemma
- On the combinatorial antipodal-point lemmas
- Complementary pivoting and the Hopf degree theorem
- A combinatorial Lefschetz fixed-point formula
- A unified approach to complementarity in optimization
- Cubical Sperner lemmas as applications of generalized complementary pivoting
- Combinatorial formulae for multiple set-valued labellings
- Generalizations of Baxter's theorem and cubical homology
- A polytopal generalization of Sperner's lemma
- A direct proof of the Gale-Nikaido-Debreu lemma using Sperner's lemma
- Kombinatorik bewerteter Komplexe
- On the Sperner lemma and some colorings of graphs
- A non-topological proof for the impossibility of \(k\)-set agreement
- A set intersection theorem and applications
- A fixed point theorem including the last theorem of Poincaré
- Achieving rental harmony with a secretive roommate
- An Odd Theorem
- Existence of balanced simplices on polytopes.
- Sperner via Vandermonde
- Computing equilibria: a computational complexity perspective
- Using volume to prove Sperner's Lemma
This page was built for publication: On the Sperner lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5547290)