activity
20172026
most citedComplexity of Maker-Breaker Games on Edge Sets of Graphs

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

collaborators

19 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…

math.CO2024

On the Metric Dimension of

Valentin Gledel, Gerold Jäger

In this work we determine the metric dimension of for all with as follows. For and , this val…

math.CO2024

On the complexity of Client-Waiter and Waiter-Client games

Valentin Gledel, Nacim Oijid, Sébastien Tavenas +1

Positional games were introduced by Hales and Jewett in 1963, and their study became more popular after Erdos and Selfridge's first result on their connection to Ramsey theory and…

math.CO2024

Partition strategies for the Maker-Breaker domination game

Guillaume Bagan, Eric Duchêne, Valentin Gledel +2

The Maker-Breaker domination game is a positional game played on a graph by two players called Dominator and Staller. The players alternately select a vertex of the graph that has…