Chvátal's toughness conjecture, that there is a number t such that every t-tough graph is Hamiltonian

Open the “Subgraphs” section on Wikipedia →

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