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

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

2011-02-04

arxiv.org/abs/1102.0962v3

Mathematics

Combinatorics

After minor revisions; to appear in JCTB

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the maximum number of five-cycles in a triangle-free graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the maximum number of five-cycles in a triangle-free graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the maximum number of five-cycles in a triangle-free graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492026