If $G$ is a graph on $n$ vertices which contains no trivial (empty or complete) subgraph on $\geq 10 lo g n$ many vertices, then must $G$ contain an induced non-trivial regular subgraph on $≫ lo g n$ many vertices?

Worked, still open.

graph theory · solved · possible · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved