Nemotron-IMO-Bench 2026 C40
A connected graph has vertices and each vertex has degree . Prove that we can delete vertices, no two of them joined by an edge, such that the resulting graph is connected.
Dataset text Nemotron-IMO-Bench. Open licence.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.