Skip to main content
Log in

Trade Spectrum of K 4e

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A K 4e trade consists of two disjoint decompositions of some simple graph H into copies of K 4e. The number of vertices of H is referred to as the foundation of the trade, while the number of copies of K 4e in each of the decompositions is called the volume of the trade. We determine the values of v and s for which there exists a K 4e trade of volume s and foundation v.

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

Access this article

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. Billington, E.J.: Combinatorial trades: a survey of recent results. Chapter 3. In: Designs 2002: Further combinatorial and constructive design theory, W.D. Wallis, (ed.), Kluwer Academic Press, Norwell, Mass., USA. (to appear)

  2. Billington, E.J., Gionfriddo, M., Lindner, C.C.: The intersection problem for K 4-e designs. J. Stat. Planning and Inference 58, 5–27 (1997)

    Google Scholar 

  3. Billington, E.J., Hoffman, D.G.: Trades and Graphs. Graphs and Combinatorics 17, 39–54 (2001)

  4. Bryant, D.E.: On the volume of trades in triple systems. Australasian J. Combinatorics 15, 161–176 (1997)

    Google Scholar 

  5. Bryant, D.E., Grannell, M., Griggs, T., Maenhaut, B.: On the volume of 4-cycle trades. Graphs and Combinatorics 19, 53–63 (2003)

    Google Scholar 

  6. Bermond, J.C., Schönheim, J.: G-decompositions of K n , where G has four vertices or less. Discrete Math. 19, 113–120 (1977)

    Google Scholar 

  7. Gionfriddo, M., Lindner, C.C., Rodger, C.A.: 2-coloring K 4-e designs. Australasian J. Combinatorics 3, 211–229 (1991)

  8. Hoffman, D.G., Lindner, C.C., Martin, J.: Sharry and Anne Penfold Street, Maximum packings of K n with copies of K 4-e. Aequationes Mathematicae 51, 247–269 (1996)

  9. Khosrovshahi, G.B., Maimani, H.R., Torabi, R.: On trades: an update. Discrete Appl. Math. 95, 361–376 (1999)

    Google Scholar 

  10. Lefevre, J.: Appendix to present paper. http://www.maths.uq.edu.au/~jgl/K4-eAppendix.pdf

  11. Maenhaut, B.: On the volume of 5-cycle trades. Graphs and Combinatorics 17, 315–328 (2001)

    Google Scholar 

  12. Mullin, R.C., Gronau, H.-D.O.F.: PBDs and GDDs: The Basics, Section III.1. In: CRC Handbook of Combinatorial Designs, C. J. Colbourn, J.H. Dinitz, (eds.), CRC Press, Boca Raton, 1996, pp. 185–193

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to James G. Lefevre.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lefevre, J. Trade Spectrum of K 4e . Graphs and Combinatorics 21, 475–488 (2005). https://doi.org/10.1007/s00373-005-0633-0

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-005-0633-0

Keywords

Navigation