{"schema":"postcutoff/event@1","as_of":"2026-11-19T22:11:00+01:00","url":"https://postcutoff.com/e/2026-11-18-mckay-praeger-conjecture-almost-all-vertex-transitive-cayley-su-xia-gpt-6-1/","md":"https://postcutoff.com/e/2026-11-18-mckay-praeger-conjecture-almost-all-vertex-transitive-cayley-su-xia-gpt-6-1/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-11-18-mckay-praeger-conjecture-almost-all-vertex-transitive-cayley-su-xia-gpt-6-1","date":"2026-11-18","date_precision":"day","short_title":"McKay–Praeger conjecture claimed","deck":"Almost all vertex-transitive graphs are Cayley graphs, with the key proposition found by GPT-6.1","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.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2611.23641: Almost all vertex-transitive graphs and digraphs are Cayley (Su, Xia)","url":"https://arxiv.org/abs/2611.23641","type":"paper","group":"primary","domain":"arxiv.org"}],"official":1,"filed":"2026-11-19","updated":"2026-11-19","orgs":["OpenAI"],"title":"McKay–Praeger conjecture claimed: almost all vertex-transitive graphs are Cayley graphs, with the key proposition found by GPT-6.1","summary":"arXiv 2611.23641 (math.CO, 18 Nov 2026), Ning Su and Binzhou Xia, 'Almost all vertex-transitive graphs and digraphs are Cayley': the proportion of Cayley digraphs among vertex-transitive digraphs of order n is at least 1 − 2^(−n/4+o(n)), and of Cayley graphs among vertex-transitive graphs at least 1 − 2^(−n/24+o(n)), as n → ∞ through all positive integers. 'This proves the McKay–Praeger conjecture and its digraph analogue.' The AI disclosure says the work 'arose from collaboration between the authors and GPT-6.1' and that the model's principal contribution was Proposition 4.1 and Sections 3–4.","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)"],"key_numbers":[],"tags":["math","algebraic-graph-theory","permutation-groups","cayley-graphs","gpt-6-1","arxiv","unrefereed"],"science":{"field":"mathematics","subfield":"algebraic graph theory and permutation groups","problem":"McKay–Praeger conjecture: the proportion of Cayley graphs among vertex-transitive graphs of order n tends to 1","result":"Proved for graphs and digraphs over all orders, with exceptions at most 2^(−n/24+o(n)) and 2^(−n/4+o(n)) of the total","open_since":"1994","ai_system":["GPT-6.1"],"human_role":"AI-assisted: GPT-6.1 found the key Proposition 4.1 and Sections 3–4; the authors staged the problem, supplied the group-theoretic framework from earlier work, and rewrote the AI's arguments","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed preprint; expert-written by specialists in the area"},"status":"pending","shock":""},"body_md":"## What happened\n\nNing Su and Binzhou Xia posted a 22-page paper proving that, as the number of vertices grows, all but an exponentially small\nfraction of vertex-transitive graphs (and digraphs) are Cayley graphs. The statement had been expected since McKay and Praeger's\nenumerations of non-Cayley vertex-transitive graphs in the 1990s. The disclosure describes a staged collaboration with GPT-6.1\nand attributes the central new proposition to the model.\n\n## Why it matters\n\nIt is a named conjecture in algebraic graph theory, claimed with a strong quantitative bound, by authors who work on the\nenumeration of permutation groups and Cayley graphs. Like most of this autumn's results it is a preprint, and the AI share is as\nthe authors describe it.","disputed":[{"label":"Verification","text":"Unrefereed preprint; expert-written by specialists in the area","sources":[]}],"related":[{"id":"2026-11-19-ai-assisted-results-november-19-listing","url":"https://postcutoff.com/e/2026-11-19-ai-assisted-results-november-19-listing/","date":"2026-11-19","date_precision":"day","short_title":"AI-assisted results, 19 Nov","deck":null,"takeaway":"The sweep listed 379 arXiv papers with AI statements (253 new on 19 Nov), 72 conjecture papers without one (20 new), 71 Hexagon works, 6 result-repo commits and 1 watched repo. Every new line was read and its AI statement checked in the PDF or the Hexagon provenance record. Four results got their own entries, a fifth (Graph Minors in Lean) came from Mathstodon, seven existing entries were extended, and 112 arXiv papers and about 45 Hexagon works where AI supplied proofs, constructions, code or Lean are listed here. All are unrefereed.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"partly","labels":["Partly confirmed"]},"sources":8,"official":8,"filed":"2026-11-19","updated":"2026-11-19","orgs":["OpenAI","Anthropic","Google DeepMind","various researchers"]},{"id":"2026-09-29-lovasz-conjecture-nearly-linear-bound-gpt-5-6-sol","url":"https://postcutoff.com/e/2026-09-29-lovasz-conjecture-nearly-linear-bound-gpt-5-6-sol/","date":"2026-09-29","date_precision":"day","short_title":"GPT-5.6 Sol supplies key steps in a nearly linear bound for the Lovász path conjecture","deck":null,"takeaway":"This is a large quantitative step on a famous 57-year-old problem in graph theory.","category":"science","category_label":"Science & math","importance":3,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":3,"official":3,"filed":"2026-10-05","updated":"2026-10-05","orgs":["OpenAI"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-19","type":"filed","text":"Created (science agent; PDF read for statement, history and AI disclosure)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-19","run":null,"sources_read":"Science agent; PDF read for statement, history and AI disclosure","updated":"2026-11-19","human_review":null,"version":null},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":171,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":141,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":232,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":171,"in_training_data":false}],"short_url":"https://postcutoff.com/s/mckay-praeger-conjecture"}