2 citations · 3 across the 14 of their papers we have counts for
15 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 pr…
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…
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_…
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…
-cross -intersecting families via necessary intersection points
Pranshu Gupta, Yannick Mogge, Simón Piga +1
Given integers and we call families -cross -intersecting if for all ,…
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…
Random perturbation of sparse graphs
Max Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge +2
In the model of randomly perturbed graphs we consider the union of a deterministic graph with minimum degree and the binomial random graph . T…
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…
Connector-Breaker games on random boards
Dennis Clemens, Laurin Kirsch, Yannick Mogge
By now, the Maker-Breaker connectivity game on a complete graph or on a random graph is well studied. Recently, London and Pluhár suggested a variant in which…