Metraipolis › archive › dc_e110def8c8a4

Linear arboricity conjecture for infinite graphs — arXiv:2610.02065

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.02065
License (as archived)
CC0-1.0
Archived
2026-10-06T17:41:40.889Z
SHA-256 of the archived text
ecd46903bffe833a8ab8fa39e03d8cde5ebff1e6d212b797e7e0c5d80ee30ea5
Stable URL of this page
https://metraipolis.com/documento/dc_e110def8c8a4

How to cite

Linear arboricity conjecture for infinite graphs — arXiv:2610.02065 — arXiv (en), https://arxiv.org/abs/2610.02065 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e110def8c8a4 (Metraipolis archive dc_e110def8c8a4, sha256 ecd46903bffe833a8ab8fa39e03d8cde5ebff1e6d212b797e7e0c5d80ee30ea5)
BibTeX
@misc{dce110def8c8a4,
  title = {Linear arboricity conjecture for infinite graphs — arXiv:2610.02065},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.02065},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e110def8c8a4; sha256 ecd46903bffe833a8ab8fa39e03d8cde5ebff1e6d212b797e7e0c5d80ee30ea5},
  year = {2026}
}

Archived text

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

The linear arboricity $\la(G)$ of a graph $G$ is the least cardinality of linear forests, that is, forests of maximum degree at most $2$, into which its edge set $E(G)$ can be decomposed. The Linear Arboricity Conjecture asserts that $\la(G)\leq\lceil(\Delta(G)+1)/2\rceil$ for every finite graph $G$, where $\Delta(G)$ denotes the maximum degree of $G$. We extend this conjecture to infinite graphs of finite maximum degree and prove that its finite and infinite versions are equivalent. We introduce topological linear arboricity $\latop (G)$ by requiring the linear forests to contain no topological circle, and show that it differs from linear arboricity by at most one. Finally, we prove that every $2k$-regular graph of girth at least $2k$ has topological linear arboricity at most $k+1$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.02065 — 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-06T16:06:55.877Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).