algorithmic graph theory 1distance constraints 1erdos-posa property 1graph decomposition 1graph separators 1induced minors 1long cycles 1parameterized bounds 1structural graph theory 1tree independence 1
From the 2 of 2 linked papers with an AI index.
2 papers
math.CO2026
Far-apart ErdÅs--Pósa property of long cycles
Maria Chudnovsky, Vida DujmoviÄ, Gwenaël Joret +4
The authors prove that for any graph, either it contains many cycles of length at least ℓ that are pairwise far apart, or a small vertex set can be removed to eliminate all such lo…
math.CO2026
Induced-Minor-Closed Classes have Linear, Square-Root, or Sub-Polynomial Tree-Independence
Maria Chudnovsky, Julien Codsi, Ajaykrishnan E S +1
The paper shows that any graph either contains a large complete bipartite graph or a large wall as an induced minor, or else its tree‑independence number grows sub‑polynomially, le…