DE-MO 2012 Problem 2
Find the maximal number of edges a connected graph with vertices may have, so that after deleting an arbitrary cycle, is not connected anymore.
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.