algorithmic graph theory 1graph decomposition 1induced minors 1structural graph theory 1tree independence 1
From the 1 of 2 linked papers with an AI index.
2 papers
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…
math.CO2026
Induced Minors and Coarse Tree Decompositions
Maria Chudnovsky, Julien Codsi, Ajaykrishnan E S +1
Let be a graph, be a vertex set in and be a positive integer. The distance -independence number of is the size of the largest subset $I \subse…