






















Attending to an open problem in the literature stated by Mirzakhani and Vondrák, we give a lower bound of the number of non-monochromatic simplices for Sperner labelings of the vertices of a triangulation of a given $ k$-simplex with vertices of integer coordinates. This triangulation maximizes the number of simplices over all the triangulations of the $ k$-simplex with vertices of integer coordinates.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。