1 problem

Let $G\sim G(n,n,p)$ be a random bipartite graph with two parts of size $n$, and let $\operatorname{tc}_3(G)$ be the minimum number of monochromatic trees whose vertices cover $G$…