Skip to main content
Log in

On complementary decompositions of the complete graph

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Brouwer, A.E.: Optimal Packings ofK 4's into aK n , J. Comb. Theory (A)26, 278–297 (1979)

    Google Scholar 

  2. Hall, Jr., M.: Combinatorial Theory. Boston, MA: Blaisdell Publishing 1967

    Google Scholar 

  3. Hanani, H.: The Existence and Construction of Balanced Incomplete Block Designs. Ann. Math. Statist.32, 361–386 (1961)

    Google Scholar 

  4. Lindner, C.C., Stinson, D.R.: Steiner Pentagon Systems. Discrete Math.52, 67–74 (1984)

    Google Scholar 

  5. Longyear, J.Q.: Nested Transversals and Small Nested Designs (preprint)

  6. Stinson, D.R.: The Spectrum of Nested Steiner Triple Systems, Graphs and Combinatorics1, 189–191 (1985)

    Google Scholar 

  7. Stinson, D.R.: A construction for authentication/secrecy codes from certain combinatorial designs (preprint)

Download references

Author information

Authors and Affiliations

Authors

Additional information

Research supported in part by an NSERC postgraduate Scholarship.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01788658

Keywords