Nemotron-IMO-Bench 2026 C18

An operation on a graph consists in choosing a $4$ -cycle (if there is one) and deleting an edge (the one you like) from this cycle. Let $n\geq 4$ . What is the least number of edges you can get by applying operations to $K_n$ ?

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.

Add a solution

Solutions

Similar problems