A note on long cycles in sparse random graphs
Abstract
Let Lc,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 Lc,n/n f(c) a.s. for c≥ 20, thus extending a result of the author and Frieze to smaller values of c. Thereafter, for c≥ 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 ∞.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.