The Albertson conjecture

the crossing number can be lower-bounded by the crossing number of a complete graph with the same chromatic number

Open the “Graph drawing and embedding” section on Wikipedia →

Source: List of unsolved problems in mathematics (CC BY-SA 4.0)