8 citations · 31 across the 24 of their papers we have counts for
31 papers
Ramsey-type results for Maker-Breaker games
Alexander Allin, Juri Barkey, Dennis Clemens
A graph is minimal Ramsey for a graph if every -colouring of the edges of contains a monochromatic copy of , but for every proper subgraph of , there is a -…
On Ramsey-type problems for paths and cycles with few colour changes
Peter Allen, Julia Böttcher, Dennis Clemens +3
In 1967, Gerencser and Gyárfás determined the exact values of the two-colour Ramsey numbers of paths. In a footnote, they made the following observation: Every -edge-coloured co…
Rainbow connectivity Maker-Breaker game
Juri Barkey, Bruno Borchardt, Dennis Clemens +3
We study biased Maker-Breaker games on a graph system , in which Maker's goal is to claim certain rainbow structures, i.e., specified subgraphs consisting of at…
Tree universality in positional games
Grzegorz Adamski, Sylwia Antoniuk, Małgorzata Bednarska-Bzdęga +3
In this paper we consider positional games where the winning sets are tree universal graphs. Specifically, we show that in the unbiased Maker-Breaker game on the complete graph $K_…
Walker-Breaker Games on
Dennis Clemens, Pranshu Gupta, Yannick Mogge
The Maker-Breaker connectivity game and Hamilton cycle game belong to the best studied games in positional games theory, including results on biased games, games on random graphs a…
Ramsey equivalence for asymmetric pairs of graphs
Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta +1
A graph is Ramsey for a pair of graphs if any red/blue-coloring of the edges of yields a copy of with all edges colored red or a copy of with all edges colo…