betaFeedback

WorksMathematics

On (Pathwidth, Clique)-boundedness

Abstract

We prove that every (\pw,ω)-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 \B_ρ nor Kσ,σK_{σ,σ} as an induced minor, where \B_ρ 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 nn-vertex graphs in any (\pw,ω)-bounded class. The lower-bound examples also give counterexamples to a conjecture of Hickingbotham and Joret. We further prove that, for every forest FF and every ℓ∈N\ell\in\N, there is a constant k=k(F,ℓ)∈Nk=k(F,\ell)\in\N such that every graph GG with no induced theta or ℓ\ell-long prism and no induced subgraph isomorphic to FF satisfies tree-independence number at most kk. This proves a strengthened form of a conjecture of Chudnovsky, Hajebi, and Trotignon. Finally, for every integer s≥2s\ge2, we characterize the forests FF for which excluding FF as an induced minor and Ks,sK_{s,s} as an induced subgraph bounds tree-independence number. This extends the characterization of Bonnet, Duhamel, and Hickingbotham, who considered bounded pathwidth with Ks,sK_{s,s} excluded as a subgraph.

Paper details

vlnc:W_g5cw96s5
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…