Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Su, Ning, Xia, Binzhou
Language: English
Topic: Finite Group Theory Research
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236762715
