4 papers · 1 filter
A labeling of the Simplex-Lattice Hypergraph with at most 2 colors on each hyperedge
Ognjen Papaz, Duško Jojić
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…
Sperner's colorings of hypergraphs arising from edgewise triangulations
Duško Jojić, Ognjen Papaz
We investigate Sperner's labelings of , the hypergraph whose hyperedges are facets of the edgewise triangulation of a -simplex defined by a permutation $π\in \mat…
Lower bounds on the number of envy-free divisions
Duško Jojić, Gaiane Panina, Rade Živaljević
We analyze lower bounds for the number of envy-free divisions, in the classical Woodall-Stormquist setting and in a non-classical case, when envy-freeness is combined with the equi…
Shelling of links and star clusters in edgewise subdivision of a simplex
Duško Jojić, Ognjen Papaz
We show that the combinatorial types of the links of the vertices in the edgewise triangulation of a -simplex are encoded by the partitions of . Each of these c…