38 citations · 39 across the 4 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
math.CO2007★ 1 cited
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…
math.CO2007
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…