Definition:Universal Graph

Let $$\mathbb{G}$$ be a set of graphs.

A universal graph in $$\mathbb{G}$$ is a graph $$K$$ in which every element of $$\mathbb{G}$$ can be embedded in $$K$$.

Note that $$K$$ need not itself be an element of $$\mathbb{G}$$.