Given a positive integer number $n$, determine the maximum number of edges a simple graph on $n$ vertices may have such that it contain no cycles of even length.
Source: 2011 Romania TST,problem 7
Tags: combinatorics unsolved, combinatorics
Given a positive integer number $n$, determine the maximum number of edges a simple graph on $n$ vertices may have such that it contain no cycles of even length.