Almost all vertex-transitive graphs and digraphs are Cayley

We prove that almost all vertex-transitive digraphs are Cayley digraphs, and that almost all vertex-transitive graphs are Cayley graphs, as the number of vertices tends to infinity through all positive integers. The proportions of Cayley objects are at least $1-2^{-n/4+o(n)}$ for digraphs and $1-2^{-n/24+o(n)}$ for graphs. This proves the McKay--Praeger conjecture and its digraph analogue.

Authors

Publication Details

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

Almost all vertex-transitive graphs and digraphs are Cayley

Binzhou Xia, Ning Su
arXiv (Cornell University)
Finite Group Theory Research
preprint

Almost all vertex-transitive graphs and digraphs are Cayley

Binzhou Xia, Ning Su
preprint en

Abstract

We prove that almost all vertex-transitive digraphs are Cayley digraphs, and that almost all vertex-transitive graphs are Cayley graphs, as the number of vertices tends to infinity through all positive integers. The proportions of Cayley objects are at least $1-2^{-n/4+o(n)}$ for digraphs and $1-2^{-n/24+o(n)}$ for graphs. This proves the McKay--Praeger conjecture and its digraph analogue.

arXiv (Cornell University)
Finite Group Theory Research
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