Problem 566

Erdős Problem #566: declared status 'open'. Formalized: yes. Let $G$ be such that any subgraph on $k$ vertices has at most $2k-3$ edges. Is it true that, if $H$ has $m$ edges and no isolated vertices, then$$R(G,H)\ll m?$$ Prize: no. Tags: graph theory, ramsey theory.