Abstract
SupposeG n={G 1, ...,G k } is a collection of graphs, all havingn vertices ande edges. By aU-decomposition ofG n we mean a set of partitions of the edge setsE(G t ) of theG i , sayE(G t )==\(\sum\limits_{j = 1}^r {E_{ij} } \) E ij , such that for eachj, all theE ij , 1≦i≦k, are isomorphic as graphs. Define the functionU(G n) to be the least possible value ofr aU-decomposition ofG n can have. Finally, letU k (n) denote the largest possible valueU(G) can assume whereG ranges over all sets ofk graphs havingn vertices and the same (unspecified) number of edges.
In an earlier paper, the authors showed that
In this paper, the value ofU k (n) is investigated fork>2. It turns out rather unexpectedly that the leading term ofU k (n) does not depend onk. In particular we show
Similar content being viewed by others
References
J. A. Bondy andU. S. R. Murty,Graph Theory with Applications, American Elsevier, New York (1976).
F. R. K. Chung, P. Erdős, R. L. Graham, S. M. Ulam andF. F. Yao, Minimal decompositions of two graphs into pairwise isomorphic subgraphs,Proc. 10 th Southeastern Conf. on Comb., Graph Th. and Comp., (1979) 3–18.
F. Frances Yao, Graph 2-isomorphism isNP-complete,Inf. Proc. Letters 9 (1979) 68–72.
Author information
Authors and Affiliations
Additional information
This work was performed while the author was a consultant at Bell Laboratoires.
Rights and permissions
About this article
Cite this article
Chung, F.R.K., Erdős, P. & Graham, R.L. Minimal decompositions of graphs into mutually isomorphic subgraphs. Combinatorica 1, 13–24 (1981). https://doi.org/10.1007/BF02579173
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02579173