Metraipolis › archive › dc_9ccfb700a98f
Induced Forest Minor Theorem for Graphs Without an Induced Star — arXiv:2609.10406
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.10406
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:19:04.535Z
- SHA-256 of the archived text
bbe9f3307f8b95252a1c6a8f5973ab74fbc97ec8446a49f8f173881e1082b09e- Stable URL of this page
https://metraipolis.com/documento/dc_9ccfb700a98f
How to cite
Induced Forest Minor Theorem for Graphs Without an Induced Star — arXiv:2609.10406 — arXiv (en), https://arxiv.org/abs/2609.10406 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9ccfb700a98f (Metraipolis archive dc_9ccfb700a98f, sha256 bbe9f3307f8b95252a1c6a8f5973ab74fbc97ec8446a49f8f173881e1082b09e)
BibTeX
@misc{dc9ccfb700a98f,
title = {Induced Forest Minor Theorem for Graphs Without an Induced Star — arXiv:2609.10406},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.10406},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9ccfb700a98f; sha256 bbe9f3307f8b95252a1c6a8f5973ab74fbc97ec8446a49f8f173881e1082b09e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10406. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Motivated by recent work on tree independence number, we study the path independence number of a graph $G$: the minimum integer $k$ such that there is a path decomposition of $G$ where each bag induces a graph with independence number at most $k$. We show that every graph excluding both an induced forest minor and an induced star has bounded path independence number. This characterises when a graph class that excludes an induced star has bounded path independence number while also partially resolving a conjecture of Dallard, Krnc, Kwon, Milani{č}, Munaro, Štorgel and Wiederrecht (2024). Furthermore, we show that graphs excluding both an apex-forest induced minor and an induced star have bounded tree independence number. As a consequence, for every fixed apex-forest $H$ and integer $t$, there is a polynomial-time algorithm to test whether a $K_{1,t}$-induced-subgraph-free graph contains $H$ as an induced minor. Moreover, it follows that the Maximum Weight Independent Set problem, as well as several other NP-hard problems, can be solved in polynomial-time on $K_{1,t}$-induced-subgraph-free graphs that exclude $H$ as an induced minor.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2609.10406 — 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-16T08:47:06.320Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).