40 citations · 242 across the 33 of their papers we have counts for
4 papers · 1 filter
Sperner's colorings and optimal partitioning of the simplex
Maryam Mirzakhani, Jan Vondrak
We discuss coloring and partitioning questions related to Sperner's Lemma, originally motivated by an application in hardness of approximation. Informally, we call a partitioning o…
Nearly optimal embeddings of trees
Benny Sudakov, Jan Vondrak
In this paper we show how to find nearly optimal embeddings of large trees in several natural classes of graphs. The size of the tree T can be as large as a constant fraction of th…
How many random edges make a dense hypergraph non-2-colorable?
Benny Sudakov, Jan Vondrak
We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. We obtain a tight bound on the…
Wide partitions, Latin tableaux, and Rota's basis conjecture
Timothy Y. Chow, C. Kenneth Fan, Michel X. Goemans +1
Say that mu is a ``subpartition'' of an integer partition lambda if the multiset of parts of mu is a submultiset of the parts of lambda, and define an integer partition lambda to b…