{
  "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\\geq 2$ vertices.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.17877",
  "author_total": 1,
  "authors": [
    {
      "name": "David R. Wood"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/64bjkm6p4eqxt.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.17877",
  "fulltext_url": null,
  "id": "64bjkm6p4eqxt",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.17877",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.DM"
    ],
    [
      "arxiv",
      "math.CO"
    ],
    [
      "arxiv",
      "math.HO"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://arxiv.org/pdf/2609.17877",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-15",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/64bjkm6p4eqxt.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:22:04Z",
      "native_id": "2609.17877",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.17877"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "The Erdős--Sós Theorem",
  "title_text": "The Erdős--Sós Theorem",
  "type": "preprint",
  "updated_at": "2026-10-30T12:22:04Z",
  "url": "https://research.draconitic.com/paper/64bjkm6p4eqxt",
  "venue": "arXiv",
  "versions": []
}