no. 16 · Tuesday 17 November 2026
A Quantitative Kuratowski Theorem
Abstract
Suppose that a graph $G$ contains exactly $k$ different subdivisions of a $K_5$ or $K_{3,3}$. We prove that in this case the crossing number of $G$ is at most $\binom{3k+7}{2}$ (and, when $k\le 2$, it is at most $k$).
- fields
- Combinatorics