5 citations · 9 across the 8 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013
Maker-Breaker games on random geometric graphs
Andrew Beveridge, Andrzej Dudek, Alan Frieze +2
In a Maker-Breaker game on a graph , Breaker and Maker alternately claim edges of . Maker wins if, after all edges have been claimed, the graph induced by his edges has some…
math.CO2013★ 2 cited
On the minimum order of k-cop-win graphs
William Baird, Andrew Beveridge, Anthony Bonato +4
We consider the minimum order graphs with a given cop number. We prove that the minimum order of a connected graph with cop number 3 is 10, and show that the Petersen graph is the…