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

Using Razborovʼs flag algebras we show that a triangle-free graph on n vertices contains at most cycles of length five. It settles in the affirmative a conjecture of Erdős.