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 $≪ n^{1 + o (1)}$ ?

Worked, still open.

graph theory · solved · possible · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved