Skip to main content
SpringerLink
Log in

An approximate version of the tree packing conjecture

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

We prove that for any pair of constants ɛ > 0 and Δ and for n sufficiently large, every family of trees of orders at most n, maximum degrees at most Δ, and with at most ( 2 n ) edges in total packs into \({K_{(1 + \varepsilon )n}}\). This implies asymptotic versions of the Tree Packing Conjecture of Gyárfás from 1976 and a tree packing conjecture of Ringel from 1963 for trees with bounded maximum degree. A novel random tree embedding process combined with the nibble method forms the core of the proof.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N. Alon and J. H. Spencer, The Probabilistic Method, third ed., Wiley-Interscience Series in Descrete Mthematics and Optimization, Wiley, Hoboken, NJ, 2008.

    Book  MATH  Google Scholar 

  2. D. Bal, A. Frieze, M. Krivelevich and P.-S. Loh, Packing tree factors in random and pseudo-random graphs, Electronic Journal of Combinatorics 21 (2014), paper 8.

    MathSciNet  MATH  Google Scholar 

  3. J. Balogh and C. Palmer, On the tree packing conjecture, SIAM Journal on Discrete Mathematics 27 (2013), 1995–2006.

    Article  MathSciNet  MATH  Google Scholar 

  4. B. Barber and E. Long, Random walks on quasirandom graphs, Electronic Journal of Combinatorics 20 (2013), no. 4, paper 25.

  5. T. Bohman, The triangle-free process, Advances in Mathematics 221 (2009), 1653–1677.

    Article  MathSciNet  MATH  Google Scholar 

  6. B. Bollobás, Some remarks on packing trees, Discrete Mathematics 46 (1983), 203–204.

    Article  MathSciNet  MATH  Google Scholar 

  7. B. Bollobás and S. E. Eldridge, Packings of graphs and applications to computational complexity, Journal of Combinatorial Theory. Series B 25 (1978), 105–124.

    Article  MathSciNet  MATH  Google Scholar 

  8. Y. Caro and Y. Roditty, A note on packing trees into complete bipartite graphs and on Fishburn’s conjecture, Discrete Mathematics 82 (1990), 323–326.

    Article  MathSciNet  MATH  Google Scholar 

  9. Y. Caro and R. Yuster, Packing graphs: the packing problem solved, Electronic Journal of Combinatorics 4 (1997), paper 1.

  10. P. A. Catlin, Subgraphs of graphs. I, Discrete Mathematics 10 (1973), 225–233.

    Article  MathSciNet  MATH  Google Scholar 

  11. F. R. K. Chung, R. L. Graham and R. M. Wilson, Quasi-random graphs, Combinatorica 9 (1989), 345–362.

    Article  MathSciNet  MATH  Google Scholar 

  12. E. Dobson, Packing trees into the complete graph, Combinatorics, Probability and Computing 11 (2002), 263–272.

    MathSciNet  MATH  Google Scholar 

  13. P. C. Fishburn, Balanced integer arrays: a matrix packing theorem, Journal of Combinatorial Theory. Series A 34 (1983), 98–101.

    Article  MathSciNet  MATH  Google Scholar 

  14. A. Gyárfás and J. Lehel, Packing trees of different order into Kn, in Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I, Colloquia Mathematica Societatis János Bolyai, Vol. 18, North-Holland, Amsterdam-New York, 1978, pp. 463–469.

    Google Scholar 

  15. A. M. Hobbs, Packing trees, in Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. II (Baton Rouge, La., 1981), Congressus Numerantium 33 (1981), 63–73.

  16. A. M. Hobbs, B. A. Bourgeois and J. Kasiraj, Packing trees in complete graphs, Discrete Mathematics 67 (1987), 27–42.

    Article  MathSciNet  MATH  Google Scholar 

  17. S. Janson, T. Ľuczak and A. Rucinski, Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000.

    Book  MATH  Google Scholar 

  18. J. H. Kim, The Ramsey number R(3, t) has order of magnitude t2/ log t, Random Structures & Algorithms 7 (1995), 173–207.

    Article  MathSciNet  MATH  Google Scholar 

  19. C. McDiarmid, On the method of bounded differences, in Surveys in combinatorics, 1989 (Norwich, 1989), London Mathematical Society Lecture Note Series, Vol. 141, Cambridge University Press, Cambridge, 1989, pp. 148–188.

    Chapter  Google Scholar 

  20. C. McDiarmid and B. Reed, Concentration for self-bounding functions and an inequality of Talagrand, Random Structures & Algorithms 29 (2006), 549–557.

    Article  MathSciNet  MATH  Google Scholar 

  21. S. Messuti, V. Rödl and M. Schacht, Packing minor closed families of graphs, submitted.

  22. G. Ringel, Problem 25, in Theory of Graphs and its Applications (Proc. Int. Symp. Smolenice 1963), Czechoslovak Academy of Sciences, Prague, 1964, pp. 162.

    Google Scholar 

  23. V. Rödl, On a packing and covering problem, European Journal of Combinatorics 6 (1985), 69–78.

    Article  MathSciNet  MATH  Google Scholar 

  24. W.-C. S. Suen, A correlation inequality and a Poisson limit theorem for nonoverlapping balanced subgraphs of a random graph, Random Structures & Algorithms 1 (1990), 231–242.

    Article  MathSciNet  MATH  Google Scholar 

  25. A. Thomason, Pseudorandom graphs, in Random graphs’ 85 (Poznań, 1985), North- Holland Mathematics Studies, Vol. 144, North-Holland, Amsterdam, 1987, pp. 307–331.

    Google Scholar 

  26. R. Yuster, On packing trees into complete bipartite graphs, Discrete Mathematics 163 (1997), 325–327.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, London School of Economics Houghton Street, London, WC2A 2AE, UK

    Julia Böttcher

  2. Institute of Mathematics, Czech Academy of Sciences, Žitná 25, Praha, Czech Republic

    Jan Hladký

  3. Institute of Computer Science, Czech Academy of Sciences, Pod Vodárenskou věží 2, 182 07, Prague, Czech Republic

    Diana Piguet

  4. Institut für Mathematik, Technische Universität Hamburg-Harburg, Am Schwarzenberg-Campus 3, 21073, Hamburg, Germany

    Anusch Taraz

Authors
  1. Julia Böttcher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Hladký
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Diana Piguet
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Anusch Taraz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Julia Böttcher.

Additional information

Support by the Institut Mittag-Leffler (Djursholm, Sweden) is gratefully acknowledged.

The Institute of Mathematics is supported by RVO:67985840. The work was done while the author was an EPSRC Research Fellow at DIMAP and Mathematics Institute at the University of Warwick.

The Institute of Computer Science has institutional support RVO:67985807. The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement no. PIEF-GA-2009-253925.

The author was supported in part by DFG grant TA 319/2-2.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Böttcher, J., Hladký, J., Piguet, D. et al. An approximate version of the tree packing conjecture. Isr. J. Math. 211, 391–446 (2016). https://doi.org/10.1007/s11856-015-1277-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11856-015-1277-2

Keywords

Search

Navigation