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 metamathematics of the graph minor theorem
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
New irrelevant-vertex theorem for (k,d)-Folio gives linkage function ℓ(k) bounded by 2^{poly(k)}.
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.
-
Optimal Bounds for the k-Disjoint Paths Problem
New irrelevant-vertex theorem for (k,d)-Folio gives linkage function ℓ(k) bounded by 2^{poly(k)}.