A note on long cycles in sparse random graphs
Combinatorics
2023-03-01 v5
Abstract
Let denote the size of the longest cycle in , constant. We show that there exists a continuous function such that a.s. for , thus extending a result of the author and Frieze to smaller values of . Thereafter, for , we determine the limit of the probability that contains cycles of every length between the length of its shortest and its longest cycles as .
Keywords
Cite
@article{arxiv.2105.13828,
title = {A note on long cycles in sparse random graphs},
author = {Michael Anastos},
journal= {arXiv preprint arXiv:2105.13828},
year = {2023}
}
Comments
16 pages