3 papers
cs.DM2026
Token positional games
Guillaume Bagan, Quentin Deschamps, Florian Galliot +2
The classical Maker-Breaker positional game is played on a board which is a hypergraph , with two players, Maker and Breaker, alternately claiming vertices of $\mathca…
math.CO2024
Graphs with span 1 and shortest optimal walks
Tanja Dravec, Mirjana MikalaÄki, Andrej Taranenko
A span of a given graph is the maximum distance that two players can keep at all times while visiting all vertices (edges) of and moving according to certain rules, that pr…
math.CO2024
Poset Positional Games
Guillaume Bagan, Eric Duchêne, Florian Galliot +5
We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset…