论文信息 - Proof of a Packing Conjecture of Bollobás

Proof of a Packing Conjecture of Bollobás

Bela Bollobas [1] conjectured the following. For any positive integer Δ and real 0 c 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.

[1] B. Bollobás,et al. Extremal Graph Theory , 2013 .

[2] Bolyai János Matematikai Társulat,et al. Combinatorial theory and its applications , 1970 .

[3] Béla Bollobás,et al. Packings of graphs and applications to computational complexity , 1978, J. Comb. Theory, Ser. B.

[4] E. Szemerédi. On sets of integers containing k elements in arithmetic progression , 1975 .

[5] Joel H. Spencer,et al. Edge disjoint placement of graphs , 1978, J. Comb. Theory B.

[6] L. Lovász. Combinatorial problems and exercises , 1979 .

[7] Frank K. Hwang,et al. Distribution of Integers into k-tuples with Prescribed Conditions , 1978, J. Comb. Theory, Ser. A.