1 problem

A graph is $k$-crossing-critical if its crossing number is at least $k$, but every proper subgraph has crossing number smaller than $k$. Richter and Salazar's conjecture. For every…