Skip to content
DraconiticResearch
Search Sources API
184,937 studies31 sourcesUpdated 49 min ago
PreprintarXiv licencearXiv

The Erdős--Sós Theorem

  • David R. Wood
Open at sourcePDFDOICite

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 t−2 contains every tree on t≥ 2 vertices.

Related

  1. A converse to the Erdős-Fuchs theorem
    Quan-Hui Yang, Lilu Zhao
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. A choice-free proof of the Erdős--Dushnik--Miller theorem
    Guozhen Shen
    arXivPreprintarXiv licenceFull textLogic & foundationsarXiv
  3. An Erdős-Pósa theorem for induced packings of even cycles
    Jungho Ahn, Lars Jaffke, O-joung Kwon +2
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. On the large-clique version of the Erdős-Sós theorem
    Kun Cheng, Yurui Tang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. An Erdős-Pach-Pollack-Tuza theorem for oriented diameter
    Jiangdong Ai, Bin Chen, Yaokun Feng
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{wood2026erdőssós,
  title = {{The Erdős--Sós Theorem}},
  author = {David R. Wood},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.17877},
  eprint = {2609.17877},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.17877},
}
RIS
TY  - UNPB
TI  - The Erdős--Sós Theorem
AU  - David R. Wood
PY  - 2026
DA  - 2026/09/15
PB  - arXiv
DO  - 10.48550/arxiv.2609.17877
UR  - https://arxiv.org/abs/2609.17877
AB  - 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 t−2 contains every tree on t≥ 2 vertices.
ER  -