Extremal Independent Set Reconfiguration - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue The Electronic Journal of Combinatorics Année : 2023

Extremal Independent Set Reconfiguration

Résumé

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 sets are widely studied: for example, it is well known that an $n$-vertex graph has at most $3^{n/3}$ maximum independent sets (and this is tight). This paper investigates the asymptotic behavior of maximum possible length of a shortest reconfiguration sequence for independent sets of size $k$ among all $n$-vertex graphs. We give a tight bound for $k=2$. We also provide a subquadratic upper bound (using the hypergraph removal lemma) as well as an almost tight construction for $k=3$. We generalize our results for larger values of $k$ by proving an $n^{2\lfloor k/3 \rfloor}$ lower bound.

Dates et versions

hal-04323655 , version 1 (05-12-2023)

Identifiants

Citer

Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé. Extremal Independent Set Reconfiguration. The Electronic Journal of Combinatorics, 2023, 30 (3), ⟨10.37236/11771⟩. ⟨hal-04323655⟩
19 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More