1 problem

Let $G$ be a graph on $n$ vertices with edge density $\varepsilon$, meaning that $G$ has $\varepsilon\binom{n}{2}$ edges, up to the interpretation of the source's phrase “…