arXiv (All)
open access
The Erdős--Sós Conjecture: A visual exposition of the proof discovered by GPT-6 Astra
The Erdős--Sós theorem states that every graph of average degree greater than $t-2$ contains every tree on $t$ vertices. A short counting proof was discovered by GPT-6 Astra in 2026. We give a visual, reader-centered exposition of that argument whose presentation differs substantially from the origi
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 Theorem#1011592
- Erdős-Sós via random cyclic orderings#1035127
- Polynomial positivity cones for Coxeter roots and walks in trees#998859
- Local large deviations for triangles in sparse random graphs#1036279
- On the asymptotics of the Erdős-Rogers function#1142289
Record · ID 1115967
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