Claims

../

2011_02_04_zhao: Zhao's main theorem (Electronic Journal of Combinatorics): for every n at least an unstated n_0, a graph on n vertices with half its vertices of degree at least n/2 contains every tree with at most n/2 edges; refereed.

2026_07_14_zeraoulia: A computer-assisted verification, posted on the site's proof-claim tab with a Zenodo archive, that the site's vertex formulation holds for every n at most 19; reclassified partial by a moderator, unreviewed, silent on n at least 20.

---