Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903545 | European Journal of Combinatorics | 2018 | 5 Pages |
Abstract
For all nâ¥9, we show that the only triangle-free graphs on n vertices maximizing the number 5-cycles are balanced blow-ups of a 5-cycle. This completely resolves a conjecture by ErdÅs, and extends results by Grzesik and Hatami, Hladký, Král', Norin and Razborov, where they independently showed this same result for large n
and for all n divisible by 5.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Bernard Lidický, Florian Pfender,