For every δ < 3/2 the ⊆-minimal minor-closed classes with density >δ form a finite explicitly identified set, yielding a 2^poly(n)-time algorithm that computes δ(excl(Z)) or reports ≥3/2 for any finite forbidden-minor set Z.
The disjoint paths problem in quadratic time
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Eulerian directed graphs of bounded carving width are well-quasi-ordered by strong immersion, with a meta-theorem extending to labeled vertices and edge orderings.
citing papers explorer
-
Obstructions for Minor-Closed Classes of limiting Densities Below 3/2
For every δ < 3/2 the ⊆-minimal minor-closed classes with density >δ form a finite explicitly identified set, yielding a 2^poly(n)-time algorithm that computes δ(excl(Z)) or reports ≥3/2 for any finite forbidden-minor set Z.
-
Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
Eulerian directed graphs of bounded carving width are well-quasi-ordered by strong immersion, with a meta-theorem extending to labeled vertices and edge orderings.