Indexed metadata

The Erdős--Sós Theorem

David R. Wood

Source record

Source: arXiv

Published: Sep 15, 2026

arXiv: 2609.17877

Open original source ↗

Source abstract

We present an exposition of a proof, discovered by GPT-6 Astra, of the Erdős--Sós Conjecture, which states that every graph with average degree greater than t2t-2 contains every tree on t2t\geq 2 vertices.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.