Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Durain, Bastien"'
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 intermediate sets remain independent. Extremal problems on independent set
Externí odkaz:
http://arxiv.org/abs/2301.02020
Autor:
Bagan, Guillaume, Deschamps, Quentin, Duchêne, Eric, Durain, Bastien, Effantin, Brice, Gledel, Valentin, Oijid, Nacim, Parreau, Aline
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 two players alternately select an unclaimed vertex of it. In the Maker
Externí odkaz:
http://arxiv.org/abs/2211.01083
Autor:
Bagan, Guillaume, Deschamps, Quentin, Duchêne, Eric, Durain, Bastien, Effantin, Brice, Gledel, Valentin, Oijid, Nacim, Parreau, Aline
Publikováno v:
In Discrete Mathematics August 2024 347(8)
Autor:
Bousquet, Nicolas, Durain, Bastien
Let $G=(V,E)$ be a graph. A (proper) $k$-edge-coloring is a coloring of the edges of $G$ such that any pair of edges sharing an endpoint receive distinct colors. A classical result of Vizing ensures that any simple graph $G$ admits a $(\Delta(G)+1)$-
Externí odkaz:
http://arxiv.org/abs/2001.01463