35 citations · 146 across the 49 of their papers we have counts for
4 papers · 1 filter
Universality of random graphs and rainbow embedding
Asaf Ferber, Rajko Nenadov, Ueli Peter
In this paper we show how to use simple partitioning lemmas in order to embed spanning graphs in a typical member of . Let the \emph{maximum density} of a graph be the…
Generating random graphs in biased Maker-Breaker games
Asaf Ferber, Michael Krivelevich, Humberto Naves
We present a general approach connecting biased Maker-Breaker games and problems about local resilience in random graphs. We utilize this approach to prove new results and also to…
Building spanning trees quickly in Maker-Breaker games
Dennis Clemens, Asaf Ferber, Roman Glebov +2
For a tree T on n vertices, we study the Maker-Breaker game, played on the edge set of the complete graph on n vertices, which Maker wins as soon as the graph she builds contains a…
A construction of almost Steiner systems
Asaf Ferber, Rani Hod, Michael Krivelevich +1
Let , , and be integers satisfying . A Steiner system with parameters , , and is a -uniform hypergraph on vertices in which every set of d…