Metraipolis › archive › dc_99dcdeba8fb9

A linear upper bound on the number of moves required for independent set reconfiguration with two sliding tokens — arXiv:2608.13130

Source: arXiv (en)
Original: https://arxiv.org/abs/2608.13130
License (as archived): CC0-1.0
Archived: 2026-10-19T04:50:13.534Z
SHA-256 of the archived text: da9ce04f810ff39ef2dd5aaed70bfb552359baccc9965a38cb5b716be6e8d502
Stable URL of this page: https://metraipolis.com/documento/dc_99dcdeba8fb9

How to cite

A linear upper bound on the number of moves required for independent set reconfiguration with two sliding tokens — arXiv:2608.13130 — arXiv (en), https://arxiv.org/abs/2608.13130 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_99dcdeba8fb9 (Metraipolis archive dc_99dcdeba8fb9, sha256 da9ce04f810ff39ef2dd5aaed70bfb552359baccc9965a38cb5b716be6e8d502)

BibTeX

@misc{dc99dcdeba8fb9,
  title = {A linear upper bound on the number of moves required for independent set reconfiguration with two sliding tokens — arXiv:2608.13130},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.13130},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_99dcdeba8fb9; sha256 da9ce04f810ff39ef2dd5aaed70bfb552359baccc9965a38cb5b716be6e8d502},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13130. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We consider the problem of shifting two tokens placed on nonadjacent vertices $u,v$ of a graph $G$ on $n$ vertices to two nonadjacent vertices $u',v'$ of $G$ using a sequence of token movements. In each step, a token is moved from the vertex it is on to a neighbour of that vertex, ensuring that the tokens remain on nonadjacent vertices after this move. We answer a question of Briański, Felsner, Hodor, and Micek [``Reconfiguring Independent Sets on Interval Graphs'', MFCS 2021] by showing that if the two tokens can be moved from their initial position to their final position, then it can be done using at most $4n$ moves.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-14 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2608.13130 — 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-19T04:28:16.168Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).