disjoint subgraphs 1erdos-pósa property 1graph minors 1parameterized algorithms 1rooted minors 1tree minors 1
From the 1 of 3 linked papers with an AI index.
3 papers
math.CO2026
ErdÅs-Pósa property of rooted tree minors
Quentin Claus, Gwenaël Joret, Clément Rambaud +1
The paper proves that for any tree T and any vertex set S in a graph G, either G contains k vertex‑disjoint T‑minors rooted in S or there is a vertex set of size O(k) whose removal…
math.CO2026
Blow-up structure of graphs excluding a tree or an apex-tree as a minor
Quentin Claus, Gwenaël Joret, Clément Rambaud
We prove blow-up structure theorems for graphs excluding a tree or an apex-tree as a minor. First, we show that for every -vertex tree with and radius , and eve…
math.CO2026
Excluding an apex-forest or a fan as quickly as possible
Quentin Claus, JÄdrzej Hodor, Gwenaël Joret +1
We show that every graph excluding an apex-forest as a minor has layered pathwidth at most , and that every graph excluding an apex-linear forest (such as a f…