Skip to main content

A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt

Combinatorica volume 42, pages 1347–1356 (2022)Cite this article

Abstract

We prove a common generalization of the celebrated Sauer-Spencer packing theorem and a theorem of Brandt concerning finding a copy of a tree inside a graph. This proof leads to the characterization of the extremal graphs in the case of Brandt’s theorem: If G is a graph and F is a forest, both on n vertices, and 3Δ(G) + ℓ* (F) ≤ n, then G and F pack unless n is even, \(G = {n \over 2}{K_2}\) and F = K1,n−1 where ℓ*(F) is the difference between the number of leaves and twice the number of nontrivial components of F.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

USD 39.95

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

References

  1. M. Aigner and S. Brandt: Embedding arbitrary graphs of maximum degree two, J. London Math. Soc. (2) 48 (1993), 39–51.

    Article  MathSciNet  MATH  Google Scholar 

  2. N. Alon and E. Fischer: 2-factors in dense graphs, Discrete Math. 152 (1996), 13–23.

    Article  MathSciNet  MATH  Google Scholar 

  3. B. Bollobás and S. E. Eldridge: Packings of graphs and applications to computational complexity, J. Combin. Theory Ser. B 25 (1978), 105–124.

    Article  MathSciNet  MATH  Google Scholar 

  4. B. Bollobás, A. Kostochka and K. Nakprasit: Packing d-degenerate graphs, J. Combin. Theory Ser. B 98 (2008), 85–94.

    Article  MathSciNet  MATH  Google Scholar 

  5. S. Brandt: Subtrees and subforests of graphs, J. Combin. Theory Ser. B 61 (1994), 63–70.

    Article  MathSciNet  MATH  Google Scholar 

  6. P. A. Catlin: Subgraphs of graphs. I, Discrete Math. 10 (1974), 225–233.

    Article  MathSciNet  MATH  Google Scholar 

  7. P. A. Catlin: Embedding subgraphs and coloring graphs under extremal degree conditions, ProQuest LLC, Ann Arbor, MI, 1976. Thesis (Ph.D.)—The Ohio State University.

    Google Scholar 

  8. B. Csaba: On the Bollobs-Eldridge conjecture for bipartite graphs, Combinatorics, Probability and Computing 16 (2007), 661–691.

    Article  MathSciNet  Google Scholar 

  9. B. Csaba, A. Shokoufandeh and E. Szemerédi: Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three, Combinatorica 23 (2003), 35–72. Paul Erdős and his mathematics (Budapest, 1999).

    Article  MathSciNet  MATH  Google Scholar 

  10. G. A. Dirac: Some theorems on abstract graphs, Proceedings of the London Mathematical Society s3–2 (1952), 69–81.

    Article  MathSciNet  MATH  Google Scholar 

  11. N. Eaton: A near packing of two graphs, J. Combin. Theory Ser. B 80 (2000), 98–103.

    Article  MathSciNet  MATH  Google Scholar 

  12. H. Kaul and A. Kostochka: Extremal graphs for a graph packing theorem of Sauer and Spencer, Combin. Probab. Comput. 16 (2007), 409–416.

    Article  MathSciNet  MATH  Google Scholar 

  13. H. Kaul, A. Kostochka and G. Yu: On a graph packing conjecture by Bollobás, Eldridge and Catlin, Combinatorica 28 (2008), 469–485.

    Article  MathSciNet  MATH  Google Scholar 

  14. H. A. Kierstead and A. V. Kostochka: Efficient graph packing via game colouring, Combin. Probab. Comput. 18 (2009), 765–774.

    Article  MathSciNet  MATH  Google Scholar 

  15. H. A. Kierstead, A. V. Kostochka and G. Yu: Extremal graph packing problems: Ore-type versus Dirac-type, in: Surveys in combinatorics 2009, volume 365 of London Math. Soc. Lecture Note Ser., 113–135. Cambridge Univ. Press, Cambridge, 2009.

    Google Scholar 

  16. N. Sauer and J. Spencer: Edge disjoint placement of graphs, J. Combin. Theory Ser. B 25 (1978), 295–302.

    Article  MathSciNet  MATH  Google Scholar 

  17. W. C. van Batenburg and R. J. Kang: Packing graphs of bounded codegree, Combin. Probab. Comput. 27 (2018), 725–740.

    Article  MathSciNet  MATH  Google Scholar 

  18. M. Woźniak: Packing of graphs, Dissertationes Math. (Rozprawy Mat.) 362 (1997), 78.

    MathSciNet  MATH  Google Scholar 

  19. H. P. Yap: Packing of graphs—a survey, in: Proceedings of the First Japan Conference on Graph Theory and Applications (Hakone, 1986), volume 72, 395–404, 1988.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgment

The authors thank the anonymous referees for their helpful suggestions for improving the exposition.

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Illinois Institute of Technology, Chicago, IL, 60616, USA

    Hemanshu Kaul & Benjamin Reiniger

Authors
  1. Hemanshu Kaul
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benjamin Reiniger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hemanshu Kaul.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Kaul, H., Reiniger, B. A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt. Combinatorica 42 (Suppl 2), 1347–1356 (2022). https://doi.org/10.1007/s00493-022-4932-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-022-4932-3

Mathematics Subject Classification (2010)

  • 05C35