no cycles of even length
Source: 2011 Romania TST,problem 7
February 4, 2012
combinatorics unsolvedcombinatorics
Problem Statement
Given a positive integer number , determine the maximum number of edges a simple graph on vertices may have such that it contain no cycles of even length.