Found 1 document(s)
Page 1 of 1
-
Given a graph $G$, a 2-coloring of the edges of $K_n$ is said to contain a \emph{balanced copy} of $G$ if we can find a copy of $G$ such that half of its edges are in each color class. If, for every sufficiently large $n...