7 citations · 33 across the 19 of their papers we have counts for
3 papers · 2 filters
What is Ramsey-equivalent to a clique?
Jacob Fox, Andrey Grinshpun, Anita Liebenau +2
A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of H. Two graphs H and H' are Ramsey-equivalent if every graph G is Ramsey for H if…
The random graph intuition for the tournament game
Dennis Clemens, Heidi Gebauer, Anita Liebenau
In the tournament game two players, called Maker and Breaker, alternately take turns in claiming an unclaimed edge of the complete graph on n vertices and selecting one of the two…
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…