Abstract
G andH, two simple graphs, can be packed ifG is isomorphic to a subgraph of\(\overline H\), the complement ofH. A theorem of Catlin, Spencer and Sauer gives a sufficient condition for the existence of packing in terms of the product of the maximal degrees ofG andH. We improve this theorem for bipartite graphs. Our condition involves products of a maximum degree with an average degree. Our relaxed condition still guarantees a packing of the two bipartite graphs.
Similar content being viewed by others
References
D. Angluin, andL. G. Valiant: Fast probabilistic algorithms for Hamiltonian circuits and matchings.Journal of Computer and System Sciences 19 (1979), 155–193.
B. Bollobás:Extremal Graph theory, Academic Press, London, 1978.
B. Bollobás:Random Graphs, Academic Press, London, 1985.
B. Bollobás, andS. E. Eldridge: Packing of graphs and applications to computational complexity,J. of Combinatorial Theory Ser. B 25 (1978), 105–124.
D. Burns, andS. Schuster: Every (p, p-1) graph is contained in its complement.J. Graph Theory 1 (1977), 277–279.
D. Burns, andS. Schuster: Embedding (p, p-1) graphs in their complements,Israel J. Math. 30 (1978), 313–320.
P. A. Catlin: Subgraphs of graphs I.,Discrete Math. 10 (1974), 225–233.
H. Chernoff: A measure of asymptotic effiency for tests of a hypothesis based on the sum of observations,Annals of Math. Stat. 23 (1952), 493–509.
P. Erdős, andJ. Spencer:Probabilistic methods in combinatorics, Akadémiai Kiadó, Budapest, 1974.
R. J. Faudree, C. C. Rousseau, R. H. Schelp, andS. Schuster: Embedding graphs in their complements,Czechoslovak Math J. 31 (1981), 53–62.
A. Gyárfás, andJ. Lehel: Packing trees of different order intoK n , in:Combinatorics, Akadémiai kiadó, Budapest 1976, 463–469
P. Hajnal: An Ω(n 4/3) lower bound on the randomized decision tree complexity of graph properties,Combinatorica 11 (1991), 131–143.
S. M. Hedetniemi, S. T. Hedetniemi, andP. J. Slater: A note on packing two trees intoK n ,Ars Combinatoria 11 (1981), 149–153.
L. Lovász:Combinatorial Problems and Exercises, North Holland, Amsterdam, 1979.
N. Sauer, andJ. Spencer: Edge-disjoint placement of graphs,J. of Combinatorial Theory Ser. B 25 (1978), 295–302.
P. J. Slater, S. K. Teo, andH. P. Yap: Packing a tree with a graph of the same size.J. Graph Theory 9 (1985), 213–216.
S. K. Teo, andH. P. Yap: Two theorems on packing of graphs,Europ. J. Combinatorics 8 (1987), 199–207.
Author information
Authors and Affiliations
Additional information
the paper was written while the authors were graduate students at the University of Chicago and was completed while the first author was at M.I.T. The work of the first author was supported in part by the Air Force under Contract OSR-86-0076 and by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center-NSF-STC88-09648. The work of the second author was supported in part by NSF grant CCR-8706518.
Rights and permissions
About this article
Cite this article
Hajnal, P., Szegedy, M. On packing bipartite graphs. Combinatorica 12, 295–301 (1992). https://doi.org/10.1007/BF01285818
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01285818