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

Abstract

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.

After minor revisions; to appear in JCTB

References in corpus (1)

• On the Number of Pentagons in Triangle-Free Graphs

Cited by in corpus (2)

• Non-three-colorable common graphs exist
• The Inducibility of Graphs on Four Vertices