Bounded maximum degree conjecture holds precisely for $c$-crossing-critical graphs with $c\le 12$

Drago Bokal, Zdeněk Dvořák, Petr Hliněný +3

We study $c$-crossing-critical graphs, which are the minimal graphs that require at least $c$ edge-crossings when drawn in the plane. For every fixed pair of integers with $c\ge 13…