graph packing


The Bollobás-Eldridge-Catlin Conjecture on graph packing ★★★

Author(s):

\begin{conjecture}[BEC-conjecture] If $G_1$ and $G_2$ are $n$-vertex graphs and $(\Delta(G_1) + 1) (\Delta(G_2) + 1) < n + 1$, then $G_1$ and $G_2$ pack. \end{conjecture}

Keywords: graph packing

Syndicate content