Abstract
In considering packing three copies of a tree into a complete bipartite graph, H. Wang (2009) gives a conjecture: For each tree T of order n and each integer k ⩾ 2, there is a k-packing of T in a complete bipartite graph Bn+k−1 whose order is n + k − 1. We prove the conjecture is true for k = 4.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.-L. Fouquet, A. P. Wojda: Mutual placement of bipartite graphs. Discrete Math. 121 (1993), 85–92.
A. M. Hobbs, B. A. Bourgeois, J. Kasiraj: Packing trees in complete graphs. Discrete Math. 67 (1987), 27–42.
H. Wang: Packing two forests into a bipartite graph. J. Graph Theory 23 (1996), 209–213.
H. Wang: Packing three copies of a tree into a complete bipartite graph. Ann. Comb. 13 (2009), 261–269.
H. Wang, N. Sauer: The chromatic number of the two-packings of a forest. The Mathematics of Paul Erdős. Vol. II. Algorithms and Combinatorics 14. Springer, Berlin, 1997, pp. 99–120.
D. B. West: Introduction to Graph Theory. Prentice-Hall, Upper Saddle River, 1996.
M. Woźniak: Packing of graphs and permutations — a survey. Discrete Math. 276 (2004), 379–391.
H. P. Yap: Packing of graphs - a survey. Discrete Math. 72 (1988), 395–404.
Acknowledgement
The authors would like to thank the referees for their careful reading of the manuscript and their valuable comments which have helped to improve the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
The research has been supported by the Education Department of Henan Province, under Grant No. 14A110026.
Rights and permissions
About this article
Cite this article
Pu, L., Tang, Y. & Gao, X. Packing four copies of a tree into a complete bipartite graph. Czech Math J 72, 39–57 (2022). https://doi.org/10.21136/CMJ.2021.0249-20
Received:
Published:
Issue Date:
DOI: https://doi.org/10.21136/CMJ.2021.0249-20