A Note on Long Cycles in Sparse Random Graphs
Abstract
Let $L_{c,n}$ denote the size of the longest cycle in $G(n,{c}/{n})$, $c>1$ constant. We show that there exists a continuous function $f(c)$ such that $ L_{c,n}/n \to f(c)$ a.s. for $c\geq 20$, thus extending a result of Frieze and the author to smaller values of $c$. Thereafter, for $c\geq 20$, we determine the limit of the probability that $G(n,c/n)$ contains cycles of every length between the length of its shortest and its longest cycles as $n\to \infty$.
Published
2023-05-05
How to Cite
Anastos, M. (2023). A Note on Long Cycles in Sparse Random Graphs. The Electronic Journal of Combinatorics, 30(2), P2.21. https://doi.org/10.37236/11471
Article Number
P2.21