1 problem

Let $H$ be a graph. For $\rho>0$, a set $S\subseteq V(G)$ is weakly $\rho$-restricted if one of $G[S]$ and $\overline{G}[S]$ contains at most $\rho|S|^2$ edges. Fox–Sudakov polynom…