Around Sperner's lemma
Combinatorics
2014-05-30 v1 Metric Geometry
Abstract
We consider a generalization of the classic Sperner lemma. This lemma states that every Sperner coloring of a triangulation of a simplex contains a fully colored simplex. We found a weaker assumption than Sperner's coloring. It is also shown that the main theorem implies Tucker's lemma and some other theorems.
Cite
@article{arxiv.1405.7513,
title = {Around Sperner's lemma},
author = {Oleg R Musin},
journal= {arXiv preprint arXiv:1405.7513},
year = {2014}
}
Comments
15 pages, 6 figures. arXiv admin note: text overlap with arXiv:1212.1899