2 citations · 3 across the 9 of their papers we have counts for
10 papers
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…
Constructions for positional games and applications to domination games
Ali Deniz Bagdas, Dennis Clemens, Fabian Hamann +1
We present constructions regarding the general behaviour of biased positional games, and amongst others show that the outcome of such a game can differ in an arbitrary way dependin…
Maker playing against an invisible Breaker
Dennis Clemens, Fabian Hamann, Mirjana Mikalački +2
We initiate the study of the phantom version of Maker-Breaker positional games. In a phantom game, the moves of one of the players are hidden from the other player, who still has t…
Biased domination games
Ali Deniz Bagdas, Dennis Clemens, Fabian Hamann +1
We consider a biased version of Maker-Breaker domination games, which were recently introduced by Gledel, Ir{š}i{č}, and Klav{ž}ar. Two players, Dominator and Staller, alternatingl…
Creating spanning trees in Waiter-Client games
Grzegorz Adamski, Sylwia Antoniuk, Małgorzata Bednarska-Bzdęga +3
For a positive integer and a tree on vertices, we consider an unbiased Waiter-Client game played on the complete graph~, in which Waiter's g…
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_…
A general approach to transversal versions of Dirac-type theorems
Pranshu Gupta, Fabian Hamann, Alp Müyesser +2
Given a collection of hypergraphs with the same vertex set, an -edge graph is a transversal if there is a bijection $…
Multistage Positional Games
Juri Barkey, Dennis Clemens, Fabian Hamann +2
We initiate the study of a new variant of the Maker-Breaker positional game, which we call multistage game. Given a hypergraph and a bias $b…
Positional games on randomly perturbed graphs
Dennis Clemens, Fabian Hamann, Yannick Mogge +1
Maker-Breaker games are played on a hypergraph , where denotes the family of winning sets. Both players alternately claim a predefined…
Fast Strategies in Waiter-Client Games on
Dennis Clemens, Pranshu Gupta, Fabian Hamann +3
Waiter-Client games are played on some hypergraph , where denotes the family of winning sets. For some bias , during each round of such a game Wai…