The strong Papadimitriou–Ratajczak conjecture

every polyhedral graph has a convex greedy embedding

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

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