2012/09/01 by Eric Babson, Babson, Eric
Engineering · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Mathematics and Applications #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1209.0102
openalex publication_date 2012/09/01 · openalex created_date 2024/04/10 · openalex updated_date 2026/07/28
Frédéric Meunier's question about a multicolored Sperner lemma is addressed, leaving the question of connectivity for the color hypergraphs of such a multicolored simplex. Sperner's lemma asserts the existence of a simplex using all the colors for any vertex coloring of a subdivision of a large simplex with appropriate boundary conditions. Meunier's questions generalizes this to the situation of having several such colorings and asserts the existence of a simplex using enough different colors from each coloring.