| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657006 | Journal of Combinatorial Theory, Series B | 2012 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
