arXiv Analytics

Sign in

arXiv:1102.0962 [math.CO]AbstractReferencesReviewsResources

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

Andrzej Grzesik

Published 2011-02-04, updated 2012-04-03Version 3

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.

Comments: After minor revisions; to appear in JCTB
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1212.3505 [math.CO] (Published 2012-12-14)
On the Maximum Number of k-Hooks of Partitions of n
arXiv:1205.6847 [math.CO] (Published 2012-05-30)
On the Maximum Number of Edges in a Hypergraph with Given Matching Number
arXiv:math/0601767 [math.CO] (Published 2006-01-31)
Empty Rectangles and Graph Dimension

Links

Toolbox