Answers are grounded in this paper and cite their sources.
We prove that every (,ω)-bounded class of graphs has bounded tree-independence number, answering a question of Bešter Štorgel, Dallard, Lozin, Milanič, and Zamaraev. We deduce this from a bound on the tree-independence number of graphs with neither _ρ nor Kσ,σ as an induced minor, where _ρ is the complete binary tree of height $ρ$ and the bound depends only on $ρ$ and $σ$. We then obtain an asymptotically sharp bound on the path-independence number of n-vertex graphs in any (,ω)-bounded class. The lower-bound examples also give counterexamples to a conjecture of Hickingbotham and Joret. We further prove that, for every forest F and every ∈, there is a constant k=k(F,)∈ such that every graph G with no induced theta or -long prism and no induced subgraph isomorphic to F satisfies tree-independence number at most k. This proves a strengthened form of a conjecture of Chudnovsky, Hajebi, and Trotignon. Finally, for every integer s≥2, we characterize the forests F for which excluding F as an induced minor and Ks,s as an induced subgraph bounds tree-independence number. This extends the characterization of Bonnet, Duhamel, and Hickingbotham, who considered bounded pathwidth with Ks,s excluded as a subgraph.
No takes yet. Share an insight, caveat, or question.
Amir Nikabadi (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: