betaFeedback

WorksMathematics

Almost all vertex-transitive graphs and digraphs are Cayley

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)1-2^{-n/4+o(n)} for digraphs and 1−2−n/24+o(n)1-2^{-n/24+o(n)} for graphs. This proves the McKay–Praeger conjecture and its digraph analogue.

Paper details

vlnc:W_9vy458v4
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 3

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

GPT-6.1

View statement
Looking for related papers…