DANUBE 2011 Problem 4
Given a positive integer number , determine the maximum number of edges a triangle-free Hamiltonian simple graph on vertices may have.
Dataset text AI-MO AoPS. Quoted with source.
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.