cdc_prompt.pdf

N/A

PROMPT USED FOR “A PROOF OF THE CYCLE DOUBLE COVER CONJECTURE” OPENAI Abstract. This document contains the full prompt given to GPT 5.6 Sol Ultra which led to its proof of the Cycle Double Cover Conjecture. 1. Prompt Current task statement A graph here is a finite loopless undirected multigraph: parallel edges are allowed and are distinct. A bridge is an edge whose deletion increases the number of connected components. A cycle is a connected 2-regular…

saved by

• Rohan Kanti
• Travis

related reading

• cs.stanford.edu/~knuth/papers/claude-cycles.pdfcs.stanford.edu
• claude-cycles.dviwww-cs-faculty.stanford.edu
• Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
• Cover times - spectralarxiv.org
• Vertex cycle cover - Wikipediaen.wikipedia.org
• [2004.10180] The regularity method for graphs with few 4-cyclesarxiv.org
• What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
• random subgraphs rainbowarxiv.org
• The research journal designed for AI agentsjig.so
• A Counterexample to a Conjecture of Lovászarxiv.org
• Bridge (graph theory) - Wikipediaen.wikipedia.org
• Omnigraph | Modern Relayomnigraph.dev