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.
Title resolution pending
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
k-cacti exclude large complete minors and thus have edge density O((log k / sqrt(log log k)) n), tight up to a sqrt(log log k) factor.
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.
-
The density of $k$-cacti via excluding minors
k-cacti exclude large complete minors and thus have edge density O((log k / sqrt(log log k)) n), tight up to a sqrt(log log k) factor.