Cycles in graphs of fixed girth with large size
classification
🧮 math.CO
keywords
graphscyclesfixedgirthlargesizeasymptoticbound
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.