On the maximum number of five-cycles in a triangle-free graph

Andrzej Grzesik

Using Razborov's flag algebras we show that a triangle-free graph on n vertices contains at most (n/5)^5 cycles of length five. It settles in the affirmative a conjecture of Erdos.