6 papers
The disjoint separators problem in graphs
Thomas Delépine, Florian Galliot, Yannick Mogge +2
We study the disjoint separators problem in graphs, an analogue of the famous disjoint paths problem. Given a graph and four pairwise disjoint subsets of vertices , ,…
Stotting in positional games
Johannes Carmesin, Yannick Mogge
We introduce variants of the Maker-Breaker and Waiter-Client games, which we call \emph{stotting}, in which a player grants a slight advantage to the opponent. We prove that a winn…
Creating triangles in Constructor-Blocker games
Chloé Boisson, Yannick Mogge, Aline Parreau +1
Generalized Turán problems investigate the maximization of the number of certain structures (typically edges) under some constraints in a graph. We study a game version of these p…
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…
Seeing is not believing in limited visibility cops and robbers
Bojan BaÅ¡iÄ, Alfie Davies, Aleksa Džuklevski +2
We consider the model of limited visibility Cops and Robbers, where the cops can only see within their -neighbourhood. We prove that the number of cops needed to see the robber…