arXiv (All)
open access
Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948
OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A tris of perfect matchings in bridgeless claw-free cubic graphs#1064662
- Cover times of the cycle graph#153626
- Full coverpages; June 2019#937880
- The maximum number of edges in minimal matching covered graphs#1105537
- 42 U.S.C. § 1862p-9 — Experimental Program to Stimulate Competitive Research#593556
Record · ID 997620
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive