IR-MO 2003 Problem 14
n \geq 6 is an integer. evaluate the minimum of f(n) s.t: any graph with n vertices and f(n) edge contains two cycle which are distinct( also they have no comon vertice)?
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.