English

A note on long cycles in sparse random graphs

Combinatorics 2023-03-01 v5

Abstract

Let Lc,nL_{c,n} denote the size of the longest cycle in G(n,c/n)G(n,{c}/{n}), c>1c>1 constant. We show that there exists a continuous function f(c)f(c) such that Lc,n/nf(c) L_{c,n}/n \to f(c) a.s. for c20c\geq 20, thus extending a result of the author and Frieze to smaller values of cc. Thereafter, for c20c\geq 20, we determine the limit of the probability that G(n,c/n)G(n,c/n) contains cycles of every length between the length of its shortest and its longest cycles as nn\to \infty.

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

R2 v1 2026-06-24T02:34:21.127Z