Year: 2026
Type: preprint
Abstract: We study the number of cycles $X$ in a uniformly random 2-factor $F$ of a random $d$-regular graph on $n$ vertices (in the pairing model) for any fixed $d\ge 3$. When the pairing $P$ and the 2-factor $F\subseteq P$ are chosen uniformly at random together, the probability generating function of $X$ is $Γ(n+\tfrac u2)Γ(\tfrac12)/\bigl(Γ(n+\tfrac12)Γ(\tfrac u2)\bigr)$, which does not depend on $d$. Consequently, $X$ has mean $\tfrac12\log n+O(1)$ and variance $\tfrac12\log n+O(1)$, satisfies a central limit theorem, and equals $1$ (so that $F$ is a Hamilton cycle) with probability $Θ(n^{-1/2})$. Using an exact formula for the second moment of the cycle generating polynomial together with small subgraph conditioning, we transfer these results to a uniformly random 2-factor of a fixed random regular graph.
Source: arXiv (Cornell University)
Authors: Adler, Katerina, Haber, Simi
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236700265
