Cycles in graphs of fixed girth with large size
Combinatorics
2016-03-31 v1
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.
Cite
@article{arxiv.1603.03526,
title = {Cycles in graphs of fixed girth with large size},
author = {József Solymosi and Ching Wong},
journal= {arXiv preprint arXiv:1603.03526},
year = {2016}
}
Comments
10 pages, 4 figures