1 problem

Let $K_{n,n}$ be the complete bipartite graph with $n$ vertices in each color class. A bipartite demand graph $D$ has vertex set $V(K_{n,n})$, and every edge of $D$ is a copy of an…