2 citations · 2 across the 4 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013
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…
math.CO2013
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…