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

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.