16 citations · 33 across the 19 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015★ 4 cited
Packing, Counting and Covering Hamilton cycles in random directed graphs
Asaf Ferber, Gal Kronenberg, Eoin Long
A Hamilton cycle in a digraph is a cycle that passes through all the vertices, where all the arcs are oriented in the same direction. The problem of finding Hamilton cycles in dire…
math.CO2015
Random-Player Maker-Breaker games
Michael Krivelevich, Gal Kronenberg
In a Maker-Breaker game, a primary question is to find the maximal value of that allows Maker to win the game (that is, the critical bias ). Erdős conjectured that…