Abstract
We consider decompositionsK n → H, whereH is eitherP 3 (the path with 3 edges) or the complete bipartite graphK 1, 3, with the property that upon taking the complement of each graph in the decomposition one obtains a new decompositionK n → Hc.
Similar content being viewed by others
References
Brouwer, A.E.: Optimal Packings ofK 4's into aK n , J. Comb. Theory (A)26, 278–297 (1979)
Hall, Jr., M.: Combinatorial Theory. Boston, MA: Blaisdell Publishing 1967
Hanani, H.: The Existence and Construction of Balanced Incomplete Block Designs. Ann. Math. Statist.32, 361–386 (1961)
Lindner, C.C., Stinson, D.R.: Steiner Pentagon Systems. Discrete Math.52, 67–74 (1984)
Longyear, J.Q.: Nested Transversals and Small Nested Designs (preprint)
Stinson, D.R.: The Spectrum of Nested Steiner Triple Systems, Graphs and Combinatorics1, 189–191 (1985)
Stinson, D.R.: A construction for authentication/secrecy codes from certain combinatorial designs (preprint)
Author information
Authors and Affiliations
Additional information
Research supported in part by an NSERC postgraduate Scholarship.
Rights and permissions
About this article
Cite this article
Granville, A., Moisiadis, A. & Rees, R. On complementary decompositions of the complete graph. Graphs and Combinatorics 5, 57–61 (1989). https://doi.org/10.1007/BF01788658
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788658