A labeling of the Simplex-Lattice Hypergraph with at most 2 colors on each hyperedge

2025/11/04 by Ognjen Papaz, Papaz, Ognjen, Duško Jojić +1
Computer Science · Engineering · #Combinatorics (math.CO) #Digital Image Processing Techniques #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2511.03036

openalex publication_date 2025/11/04 · openalex created_date 2025/11/07 · openalex updated_date 2026/07/28

Abstract

This paper provides a positive answer to the question of Mirzakhani and Vondrak that asks if there is a Sperner-admissible labeling of the simplex-lattice hypergraph such that each hyperedge uses at most 2 colors.

Citations

• Edgewise Subdivision of a Simplex

Related

• Sperner's colorings of hypergraphs arising from edgewise triangulations
• Sperner's colorings and optimal partitioning of the simplex
• Meunier Conjecture
• Ramsey theory constructions from hypergraph matchings
• On the minimum number of non-monochromatic simplices for Sperner labelings of a regular triangulation