erdős #22
Let and be sufficiently large depending on . Is there a graph on vertices with many edges which contains no such that the largest independent set has size at most ?
Worked, still open.
graph theory · solved · possible · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problems