is it hard?
Source: Iran(2003)
March 16, 2004
inductioncombinatorics unsolvedcombinatorics
Problem Statement
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)?