We say $G$ is Ramsey size linear if $R (G, H) ≪ m$ for all graphs $H$ with $m$ edges and no isolated vertices.Are there infinitely many graphs $G$ which are not Ramsey size linear but such that all of its subgraphs are?

Worked, still open.

graph theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved