erdős #1018
Let . Is there a constant such that, for all large , every graph on vertices with at least edges must contain a subgraph on at most vertices which is non-planar?
Worked, still open.
graph theory · solved · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problems