1 problem

Let $m$ and $k$ be positive integers with $k\in\{1,\ldots,m\}$. Construct an Erdős–Rényi graph on $m$ vertices by connecting each pair independently with probability $1/2$, then pl…