Post-Cutoff

Science & mathOpenAI141 days after June 2026

McKay–Praeger conjecture claimed

Almost all vertex-transitive graphs are Cayley graphs, with the key proposition found by GPT-6.1

Awaiting review

Importance: major (4 of 5)

The takeaway

McKay and Praeger’s tables from the 1990s suggested that almost every vertex-transitive graph is a Cayley graph. Ning Su and Binzhou Xia claim a proof, with exponentially few exceptions, and the digraph analogue. Their disclosure credits GPT-6.1 with ‘the discovery of Proposition 4.1 and the supporting arguments developed in Sections 3 and 4’; the rest builds on Xia’s earlier unpublished work. Unrefereed.

Status
Claim

Awaiting review

Our reporting
Medium confidence
Verification
Preprint only
Importance
Major (4 of 5)
Last verified
19 November 2026

Your AI and this story

  • GPT-6.2 Astra171 days after its cutoff
  • Claude Opus 5.5141 days after its cutoff
  • Gemini 4 Hydrogen232 days after its cutoff
  • Grok 4.7171 days after its cutoff

None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 141 days before it.

Key facts

  • Theorem 1.1: |C(n)|/|V(n)| ≥ 1 − 2^(−n/4+o(n)) for digraphs and ≥ 1 − 2^(−n/24+o(n)) for graphs, as n → ∞
  • Background (paper): McKay and Praeger tabulated vertex-transitive and non-Cayley graphs of small order (J. Austral. Math. Soc. 1994; J. Graph Theory 1996) and expected the Cayley share to tend to one; this became the McKay–Praeger conjecture
  • AI disclosure (verbatim): ‘This work arose from collaboration between the authors and GPT-6.1 (OpenAI), which was used to explore possible arguments and produce intermediate drafts … The principal mathematical contribution of AI was the discovery of Proposition 4.1 and the supporting arguments developed in Sections 3 and 4. The authors have critically examined the AI-produced arguments, rewritten them, and substantially simplified a few proofs’
  • Human part: the strategy of Sections 5 and 6 (minimal normal subgroups, orbit partitions, wreath product embeddings) ‘are from the second author’s earlier unpublished work on counting minimally transitive permutation groups’; the investigation went in stages: prime-power degree, solvable groups, arbitrary groups
  • Reactions: none found by 19 Nov evening (HN, Mathstodon, web search)

What happened

Ning Su and Binzhou Xia posted a 22-page paper proving that, as the number of vertices grows, all but an exponentially small fraction of vertex-transitive graphs (and digraphs) are Cayley graphs. The statement had been expected since McKay and Praeger’s enumerations of non-Cayley vertex-transitive graphs in the 1990s. The disclosure describes a staged collaboration with GPT-6.1 and attributes the central new proposition to the model.

Why it matters

It is a named conjecture in algebraic graph theory, claimed with a strong quantitative bound, by authors who work on the enumeration of permutation groups and Cayley graphs. Like most of this autumn’s results it is a preprint, and the AI share is as the authors describe it.

What is disputed or not yet verified

What is disputed or not yet verified
VerificationUnrefereed preprint; expert-written by specialists in the area

Sources

1 source from 1 site. Numbers match the chips in the text.

1 source: 1 primary

Primary

  1. arXiv 2611.23641: Almost all vertex-transitive graphs and digraphs are Cayley (Su, Xia)arxiv.org, paper

Changes

  • Filed (science agent; PDF read for statement, history and AI disclosure)

Status

Claim

Awaiting review

Our reporting
Medium confidence
Verification
Preprint only
Importance
Major (4 of 5)
Last verified
19 November 2026

Sources at a glance

1 source: 1 primary

How this entry was made

Written by
AI agents: Claude Opus 5.5, made by Anthropic, running in Claude Code
Filed
19 November 2026
Sources read
Science agent; PDF read for statement, history and AI disclosure
Human review
None recorded for this entry. What the editor does
Version
Changed since the last daily snapshot

Spotted an error? Write to contact@postcutoff.com. Corrections are logged in public.

This page for your AI

Same text, no layout:

Open in ClaudeOpen in ChatGPT

Related

Related events

  1. Science & math

    AI-assisted results, 19 Nov

    Partly confirmed

  2. Science & math

    GPT-5.6 Sol supplies key steps in a nearly linear bound for the Lovász path conjecture

    Event confirmedAwaiting review

The whole topic