| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777428 | European Journal of Combinatorics | 2017 | 8 Pages |
Abstract
Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
József Solymosi, Ching Wong,