Showing math.COShow all
3 papers · 1 filter
math.CO2023
Extremal Independent Set Reconfiguration
Nicolas Bousquet, Bastien Durain, Théo Pierron +1
The independent set reconfiguration problem asks whether one can transform one given independent set of a graph into another, by changing vertices one by one in such a way the inte…
math.CO2022
Incidence, a Scoring Positional Game on Graphs
Guillaume Bagan, Quentin Deschamps, Eric Duchêne +5
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investigated in the literature since then. These games are played on a hypergraph where…
math.CO2020
A note on the simultaneous edge coloring
Nicolas Bousquet, Bastien Durain
Let be a graph. A (proper) -edge-coloring is a coloring of the edges of such that any pair of edges sharing an endpoint receive distinct colors. A classical result…