Let $G$ be a graph on $n$ vertices such that at least $n /2$ vertices have degree at least $n /2$ . Must $G$ contain every tree on at most $n /2$ vertices?

Worked, still open.

graph theory · open · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

open