### Abstract

Béla Bollobás [1] conjectured the following. For any positive integer Δ and real 0 <c <½ there exists an n_{0} with the following properties. If n ≥ n_{0}, T is a tree of order n and maximum degree Δ, and G is a graph of order n and maximum degree not exceeding cn, then there is a packing of T and G. Here we prove this conjecture. Auxiliary Theorem 2.1 is of independent interest.

Original language | English |
---|---|

Pages (from-to) | 241-255 |

Number of pages | 15 |

Journal | Combinatorics Probability and Computing |

Volume | 4 |

Issue number | 3 |

DOIs | |

Publication status | Published - 1995 |

### ASJC Scopus subject areas

- Applied Mathematics
- Theoretical Computer Science
- Statistics and Probability
- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'Proof of a Packing Conjecture of Bollobás'. Together they form a unique fingerprint.

## Cite this

Komlós, J., Sárközy, G. N., & Szemerédi, E. (1995). Proof of a Packing Conjecture of Bollobás.

*Combinatorics Probability and Computing*,*4*(3), 241-255. https://doi.org/10.1017/S0963548300001620