1 problem

For $d \in \mathbb{Q}$ and $n \in \mathbb{N}$, let $\mathcal{H}_d(n)$ be the family of all graphs with $n$ vertices and density at most $d$, where the density of a graph $H$ is … A…