Let $\Bbb G$ be a set of graphs.
A universal graph in $\Bbb G$ is a graph $K$ in which every element of $\Bbb G$ can be embedded in $K$.
Note that $K$ need not itself be an element of $\Bbb G$.
