2000 character limit reached
A note on long cycles in sparse random graphs
Published 28 May 2021 in math.CO | (2105.13828v5)
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 the author and Frieze 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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.