Abstract
Sperner lemma [1928] is probably one of the most elegant and fundamental results in combinatorial topology. As we have seen, this lemma provides a very important geometric background for developing simplicial methods. Recall this lemma states that given a simplicial subdivision of the unit simplex S n and a labeling function L from the set of vertices of simplices of the simplicial subdivision into the set I n , there exists a completely labeled simplex, if x i = 0 implies that L(x)≠ i for any vertex x ∈ S n.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Yang, Z. (1999). Sperner Theory. In: Computing Equilibria and Fixed Points. Theory and Decision Library, vol 21. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-4839-0_14
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4839-0_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5070-3
Online ISBN: 978-1-4757-4839-0
eBook Packages: Springer Book Archive