On the maximum number of five-cycles in a triangle-free graph
Preprint
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.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- On the number of pentagons in triangle-free graphsJournal of Combinatorial Theory, Series A, 2013
- Hypergraphs Do JumpCombinatorics, Probability and Computing, 2010
- On 3-Hypergraphs with Forbidden 4-Vertex ConfigurationsSIAM Journal on Discrete Mathematics, 2010
- Flag algebrasThe Journal of Symbolic Logic, 2007
- On the number ofC 5′S in a triangle-free graphCombinatorica, 1989