Metraipolis › archive › dc_071ef8a65b6b
Connectivity of the reconfiguration graph of Hamiltonian paths — arXiv:2610.05068
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.05068
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T16:51:54.477Z
- SHA-256 of the archived text
f29321f6c143d5bb733812fcb855a653342dc56a77f0d376eb8cb5db810cc462- Stable URL of this page
https://metraipolis.com/documento/dc_071ef8a65b6b
How to cite
Connectivity of the reconfiguration graph of Hamiltonian paths — arXiv:2610.05068 — arXiv (en), https://arxiv.org/abs/2610.05068 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_071ef8a65b6b (Metraipolis archive dc_071ef8a65b6b, sha256 f29321f6c143d5bb733812fcb855a653342dc56a77f0d376eb8cb5db810cc462)
BibTeX
@misc{dc071ef8a65b6b,
title = {Connectivity of the reconfiguration graph of Hamiltonian paths — arXiv:2610.05068},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.05068},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_071ef8a65b6b; sha256 f29321f6c143d5bb733812fcb855a653342dc56a77f0d376eb8cb5db810cc462},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.05068. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A backbite on a Hamiltonian path of a graph $G$ adds an edge of $G$ from an endpoint $u$ of the path to a vertex $v$ and deletes an edge of the path at $v$ so that the result is again a Hamiltonian path. We study the connectivity of the reconfiguration graph $R(G)$, whose vertices are the Hamiltonian paths of $G$, with two adjacent when a single backbite carries one to the other. We prove that $R(G)$ is connected whenever $G$ contains the square of a Hamiltonian path as a spanning subgraph, and that any two Hamiltonian paths can be reconfigured using $O(n^2)$ backbites. Combining the theorem with known results on spanning squared paths gives connectivity for every graph with $\delta(G)\ge\lceil\frac{2n-1}3\rceil$, for the circulants $\mathrm{Circ}(n;S)$ with $a,2a\in S$ for some $a$ coprime to $n$, and, with high probability, for the random graph $G(n,p)$ with $p\ge c/\sqrt n$, for a sufficiently large constant $c$. In the other direction, graphs with arbitrarily high connectivity may have disconnected reconfiguration graphs. For every $n\ge8$ and every $1\le m\le\lfloor n/2\rfloor-3$ we construct a graph on $n$ vertices with $\kappa=\lambda=\delta=m$ whose reconfiguration graph is disconnected, with at least $(n-2m-4)!$ components. We conjecture that $\delta(G)\ge n/2$ suffices for connectivity.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.05068 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T15:19:19.986Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).