3 papers
math.CO2026
On the damage number of graphs
Valentin Gledel, William B. Kinnersley, Balázs Patkós +1
We study a variant of Cops and Robbers in which the robber attempts to visit as many vertices of the graph as possible without being captured, while the cop aims to keep the robber…
cs.DM2026
Positional s-of-k games
Eric Duchêne, Valentin Gledel, MiloÅ¡ StojakoviÄ
We introduce a general framework for positional games in which players score points by claiming a prescribed portion of each winning set, extending the notion of scoring Maker-Brea…
math.CO2025
The Avoider-Enforcer game on hypergraphs of rank 3
Florian Galliot, Valentin Gledel, Aline Parreau
In the Avoider-Enforcer convention of positional games, two players, Avoider and Enforcer, take turns selecting vertices from a hypergraph H. Enforcer wins if, by the time all vert…