Yannick Mogge

activity

20192026

most citedFast Strategies in Waiter-Client Games on

K_{n}

2 citations · 3 across the 14 of their papers we have counts for

collaborators

Showing 2020Show all

4 papers · 1 filter

math.CO2020

$r$ -cross $t$ -intersecting families via necessary intersection points

Pranshu Gupta, Yannick Mogge, Simón Piga +1

Given integers $r \geq 2$ and $n, t \geq 1$ we call families $F_{1}, \dots, F_{r} \subseteq P ([n])$ $r$ -cross $t$ -intersecting if for all $F_{i} \in F_{i}$ ,…

math.CO2020★ 1 cited

Positional games on randomly perturbed graphs

Dennis Clemens, Fabian Hamann, Yannick Mogge +1

Maker-Breaker games are played on a hypergraph $(X, F)$ , where $F \subseteq 2^{X}$ denotes the family of winning sets. Both players alternately claim a predefined…

math.CO2020

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 $G_{α}$ with minimum degree $α n$ and the binomial random graph $G (n, p)$ . T…

math.CO2020★ 2 cited

Fast Strategies in Waiter-Client Games on $K_{n}$

Dennis Clemens, Pranshu Gupta, Fabian Hamann +3

Waiter-Client games are played on some hypergraph $(X, F)$ , where $F$ denotes the family of winning sets. For some bias $b$ , during each round of such a game Wai…

r-cross t-intersecting families via necessary intersection points

Positional games on randomly perturbed graphs

Random perturbation of sparse graphs

Fast Strategies in Waiter-Client Games on Kn​

$r$ -cross $t$ -intersecting families via necessary intersection points

Fast Strategies in Waiter-Client Games on $K_{n}$