/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
The Bollobás–Eldridge–Catlin conjecture on graph packing (1978)
References:
[BE78] Bollobás, B. and Eldridge, S. E. (1978). "Packings of graphs and applications to
computational complexity." J. Combin. Theory Ser. B 25, pp. 105--124.
[Ca74] Catlin, P. A. (1974). "Subgraphs of graphs, I." Discrete Math. 10, pp. 225--233.
[SS78] Sauer, N. and Spencer, J. (1978). "Edge disjoint placement of graphs."
J. Combin. Theory Ser. B 25, pp. 295--302.
[AF93] Aigner, M. and Brandt, S. (1993). "Embedding arbitrary graphs of maximum degree two."
J. London Math. Soc. 48, pp. 39--51.
[CSS03] Csaba, B., Shokoufandeh, A. and Szemerédi, E. (2003). "Proof of a conjecture of
Bollobás and Eldridge for graphs of maximum degree three." Combinatorica 23, pp. 35--72.
If $G_1$ and $G_2$ are graphs on the same $n$ vertices with maximum degrees $\Delta_1$,
$\Delta_2$ satisfying $(\Delta_1 + 1)(\Delta_2 + 1) \le n + 1$, then $G_1$ and $G_2$ pack.