A labeling of the Simplex-Lattice Hypergraph with at most 2 colors on each hyperedge
Combinatorics
2025-11-06 v1
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.
Cite
@article{arxiv.2511.03036,
title = {A labeling of the Simplex-Lattice Hypergraph with at most 2 colors on each hyperedge},
author = {Ognjen Papaz and Duško Jojić},
journal= {arXiv preprint arXiv:2511.03036},
year = {2025}
}