Let $r \geq 4$ . If $G$ is a graph on $n$ vertices with at least $ex (n; K_{r})$ edges then must $G$ contain a vertex with degree $d ≫_{r} n$ whose neighbourhood contains at least $ex (d; K_{r - 1})$ edges?

Worked, still open.

graph theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved