3 problems

Conlon–Sudakov–Scott saturation bounded sparse-pair conjecture. For every graph $H$ there exist $\varepsilon,s>0$ such that for every $\varepsilon$-bounded graph $G$ on $n$ vertice…

Conlon–Sudakov–Scott bounded sparse-pair conjecture. For every graph $H$ there exist $\varepsilon,s>0$ such that for every $H$-free $\varepsilon$-bounded graph $G$ on $n>1$ vertice…

Conlon–Sudakov–Scott density-pair conjecture. For every graph $H$ there exist $\varepsilon,s>0$ such that for every $H$-free graph $G$ on $n>1$ vertices and every $c$ with…