arXiv (All)
open access
Erdős-Sós via random cyclic orderings
We present a simplified proof of the Erdős-Sós Conjecture on trees in graphs, which is based on its recent resolution by GPT-6 Astra. At the same time, we also give another proof of the corresponding conjecture for antidirected trees in digraphs, posed by Addario-Berry, Havet, Linhares Sales, Reed,
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
- The Erdős--Sós Conjecture: A visual exposition of the proof discovered by GPT-6 Astra#1115967
- Are trees really just butterflies in disguise?#987934
- The coarse Erdős-Pósa theorem#1077343
- The Erdős--Sós Theorem#1011592
- An $\tilde Ω(\log n \log m)$ Information-Theoretic Lower Bound for Randomized Online Set Cover#1034420
Record · ID 1035127
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