The number of $k$-factors of a random regular graph

Let $Z_k(G)$ be the number of $k$-factors ($k$-regular spanning subgraphs) of a uniformly random simple $d$-regular graph $G\sim G(n,d)$, where $d\ge 3$ and $1\le k\le d-1$ are fixed integers such that $dn$ and $kn$ are even. We determine the asymptotic second moment of $Z_k(G)$ and show that $Z_k(G)/\mathbb{E} Z_k(G)$ converges in distribution to an explicit random variable $W$ that depends on the short-cycle counts of $G$ but not on $k$. Moreover, for any $1\le k,\ell\le d-1$, the normalised counts on the same graph satisfy $Z_k(G)/\mathbb{E} Z_k(G) - Z_\ell(G)/\mathbb{E} Z_\ell(G) \to 0$ in probability, and, since $W>0$ almost surely, their ratio converges to $1$ in probability. This extends results of Bollobás--McKay and Janson for $k=1$ and Robalewska for $k=2$ to all $1\le k\le d-1$. In the pairing model, the second moment reduces to a one-dimensional lattice sum over the overlap of two $k$-factors. We evaluate this sum using the Poisson-binomial representation of the hypergeometric distribution, exponential tilting, and a uniform local limit theorem.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24593
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The number of $k$-factors of a random regular graph

Katerina Adler, Simi Haber
arXiv (Cornell University)
Limits and Structures in Graph Theory
preprint

The number of $k$-factors of a random regular graph

Katerina Adler, Simi Haber
preprint en

Abstract

Let $Z_k(G)$ be the number of $k$-factors ($k$-regular spanning subgraphs) of a uniformly random simple $d$-regular graph $G\sim G(n,d)$, where $d\ge 3$ and $1\le k\le d-1$ are fixed integers such that $dn$ and $kn$ are even. We determine the asymptotic second moment of $Z_k(G)$ and show that $Z_k(G)/\mathbb{E} Z_k(G)$ converges in distribution to an explicit random variable $W$ that depends on the short-cycle counts of $G$ but not on $k$. Moreover, for any $1\le k,\ell\le d-1$, the normalised counts on the same graph satisfy $Z_k(G)/\mathbb{E} Z_k(G) - Z_\ell(G)/\mathbb{E} Z_\ell(G) \to 0$ in probability, and, since $W>0$ almost surely, their ratio converges to $1$ in probability. This extends results of Bollobás--McKay and Janson for $k=1$ and Robalewska for $k=2$ to all $1\le k\le d-1$. In the pairing model, the second moment reduces to a one-dimensional lattice sum over the overlap of two $k$-factors. We evaluate this sum using the Poisson-binomial representation of the hypergeometric distribution, exponential tilting, and a uniform local limit theorem.

arXiv (Cornell University)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon