Combinatorial Trades: A Survey of Recent Results

  • Elizabeth J. Billington
Chapter
Part of the Mathematics and Its Applications book series (MAIA, volume 563)

Abstract

The concept of a trade in a combinatorial structure has existed for some years now. However, in the last five years or so there has been a great deal of activity in the area. This survey paper builds upon the one by Khosrovshahi, Maimani and Torabi which appeared in Discrete Applied Mathematics (Volume 95, pp. 361–176) in 1999. In the short time since that survey appeared, the number of papers in the area has almost doubled. Trades are used in designs and latin squares; they also crop up in graph theory. In this paper the most recent work on trades is surveyed, with applications given.

Keywords

Hexagonal Triad Culmination 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P. Adams, E.J. Billington, D.E. Bryant and A. Khodkar, The µ-way intersection problem for m-cycle systems, Discrete Mathematics 231 (2001), 27–56.CrossRefMATHMathSciNetGoogle Scholar
  2. [2]
    P. Adams, E.J. Billington, D.E. Bryant and E.S. Mahmoodian, The three-way intersection problem for latin squares, Discrete Math. (to appear).Google Scholar
  3. [3]
    P. Adams, E.J. Billington, D.E. Bryant and E.S. Mahmoodian, On the possible volumes of,µ-way latin trades, Aequationes Mathematicae (to appear).Google Scholar
  4. [4]
    P. Adams, A. Khodkar and C. Ramsay, Smallest defining sets of some STS (19), J. Combin. Math. Combin. Comput. 38 (2001), 225–230.MATHMathSciNetGoogle Scholar
  5. [5]
    R. Bean, D. Donovan, A. Khodkar and A.P. Street, Steiner trades that give rise to completely decomposable latin interchanges, Proc. Eleventh Australasian Workshop on Combinatorial Algroithms, University of Newcastle, NSW, 2000, pp. 17–30.Google Scholar
  6. [6]
    E.J. Billington, Further constructions of irreducible designs, Congressus Numerantium 35 (1982), 77–89.MathSciNetGoogle Scholar
  7. [7]
    E.J. Billington, The intersection problem for combinatorial designs, Congressus Numerantium 92 (1993), 33–54.MathSciNetGoogle Scholar
  8. [8]
    E.J. Billington, Decomposing complete tripartite graphs into cycles of lengths 3 and 4, Discrete Mathematics 197/198 (1999), 123–135.Google Scholar
  9. [9]
    E.J. Billington, M. Gionfriddo and C.C. Lindner, The intersection problem for K 4e designs, J. Statistical Planning and Inference 58 (1997), 5–27.CrossRefMATHMathSciNetGoogle Scholar
  10. [10]
    E.J. Billington and D.G. Hoffman, Trades and graphs, Graphs and Combinatorics 17 (2001), 39–54.CrossRefMATHMathSciNetGoogle Scholar
  11. [11]
    E.J. Billington and D.G. Hoffman, Trade spectra of complete partite graphs, Discrete Mathematics (to appear).Google Scholar
  12. [12]
    E.J. Billington and D.G. Hoffman, Decomposition of complete tripartite graphs into gregarious 4-cycles, Discrete Mathematics (to appear)Google Scholar
  13. [13]
    D.E. Bryant, On the volume of trades in triple systems, Australasian Journal of Combinatorics 15 (1997), 161–176.MATHMathSciNetGoogle Scholar
  14. [14]
    D.E. Bryant, M. Grannell, T. Griggs and B. Maenhaut, On the volume of 4-cycle trades, submitted.Google Scholar
  15. [15]
    D.E. Bryant and B.M. Maenhaut, Defining sets of G-designs, Australasian Journal of Combinatorics 17 (1998), 257–266.MATHMathSciNetGoogle Scholar
  16. [16]
    N.J. Cavenagh, Graph decompositions of complete tripartite graphs using trades, M.Sc. Thesis, University of Queensland, 1998.Google Scholar
  17. [17]
    N.J. Cavenagh, Decompositions of complete tripartite graphs into triangles with an edge attached, Utilitas Mathematica (to appear).Google Scholar
  18. [18]
    N.J. Cavenagh and E.J. Billington, On decomposing complete tripartite graphs into 5-cycles, Australasian Journal of Combinatorics 22 (2000), 41–62.MATHMathSciNetGoogle Scholar
  19. [19]
    C. Delaney, B.D. Gray, K. Gray, B.M. Maenhaut, M.J. Sharry and A.P. Street, Pointwise defining sets and trade cores, Australasian Journal of Combinatorics 16 (1997), 51–76.MATHMathSciNetGoogle Scholar
  20. [20]
    D. Donovan, A. Howse and P. Adams, A discussion of latin interchanges, J. Combin. Math. Combin. Comput. 23 (1997), 161–182.MATHMathSciNetGoogle Scholar
  21. [21]
    Z. Eslami and G.B. Khosrovshahi, A complete classification of 3(11,4,4) designs with nontrivial automorphism group, Journal of Combinatorial Designs 8 (2000), 419–425.CrossRefMATHMathSciNetGoogle Scholar
  22. [22]
    Z. Eslami and G.B. Khosrovshahi, Some new 6-(14,7,4) designs, J. Combinatorial Theory series A 93 (2001), 141–152.CrossRefMATHMathSciNetGoogle Scholar
  23. [23]
    Z. Eslami and B. Tayfeh-Rezaie, On 2-(v, 3) trades of minimum volume, Australasian Journal of Combinatorics 19 (1999), 239–251.MATHMathSciNetGoogle Scholar
  24. [24]
    H.-L. Fu, On the construction of certain type of latin squares with prescribed intersections, Ph.D. Thesis, Auburn University, 1980.Google Scholar
  25. [25]
    C.-M. Fu and H.-L. Fu, The intersection problem of Latin squares, Graphs, designs and combinatorial geometries (Catania, 1989), J. Combin. Inform. System Sci. 15 (1990), 89–95.MATHMathSciNetGoogle Scholar
  26. [26]
    B.D. Gray, The maximum number of trades of volume four in a symmetric design, Utilitas Mathematica 52 (1997), 193–203.MATHMathSciNetGoogle Scholar
  27. [27]
    B.D. Gray and C. Ramsay, On the spectrum of Steiner (v, k, t) trades II, Graphs and Combinatorics 15 (1999), 405–415.CrossRefMATHMathSciNetGoogle Scholar
  28. [28]
    B.D. Gray and C. Ramsay, On the spectrum of Steiner (v, k, t) trades I, J. Combin. Math. Combin. Comput. 34 (2000), 133–158.MATHMathSciNetGoogle Scholar
  29. [29]
    N. Hamilton and A. Khodkar, On minimum possible volumes of strong Steiner trades. Australasian Journal of Combinatorics 20 (1999), 197–203.MATHMathSciNetGoogle Scholar
  30. [30]
    A.S. Hedayat, The theory of trade-off for t-designs, Coding Theory and Design Theory, Part II, IMA Vol. Math. Appl., 21, 101–126, Springer, New York, 1990.Google Scholar
  31. [31]
    A. Hedayat and H.L. Hwang, Construction of BIB designs with various support sizes — with special emphasis for v = 8 and k = 4, J. Combinatorial Theory, series A 36 (1984), 163–173.CrossRefMathSciNetGoogle Scholar
  32. [32]
    P.D. Jenkins, Combinatorial trades, University of Queensland Honours Thesis, 2001.Google Scholar
  33. [33]
    A.D. Keedwell, Critical sets for latin squares, graphs and block designs: a survey, Congessus Numerantium 113 (1996), 231–245.MATHMathSciNetGoogle Scholar
  34. [34]
    A. Khodkar, Smallest defining sets for the 36 non-isomorphic twofold triple systems of order nine, J. Combin. Math. Combin. Comput. 17 (1995), 209–215.MATHMathSciNetGoogle Scholar
  35. [35]
    A. Khodkar and D.G. Hoffman, On the non-existence of Steiner (y, k, 2) trades with certain volumes, Australasian Journal of Cornbinatorics 18 (1998), 303–311.MATHMathSciNetGoogle Scholar
  36. [36]
    G.B. Khosrovshahi and E.S. Mahmoodian, A linear algebraic algorithm for reducing the support size of t-designs and to generate a basis for trades, Communications in Statistics, Simulation and Computation 16 (1987), 1015–1038.CrossRefMATHGoogle Scholar
  37. [37]
    G.B. Khosrovshahi and H.R. Maimani, On 2-(v, 3) Steiner trades of small volumes, Ars Combinatoria 52 (1999), 199–220.MATHMathSciNetGoogle Scholar
  38. [38]
    G.B. Khosrovshahi, H.R. Maimani and R. Torabi, On trades: an update, Discrete Applied Mathematics 95 (1999), 361–376.CrossRefMATHMathSciNetGoogle Scholar
  39. [39]
    G.B. Khosrovshahi, A. Nowzari-Dalini and R. Torabi, Trading signed designs and some new 4-(12,5,4) designs, Designs, Codes and Cryptography 11 (1997), 279–288.CrossRefMATHMathSciNetGoogle Scholar
  40. [40]
    G.B. Khosrovshahi and R. Torabi, Maximal trades, Ars Combinatoria 51 (1999), 211–223.MATHMathSciNetGoogle Scholar
  41. [41]
    G.B. Khosrovshahi and H. Yousefi-Azari, Octahedrals in Steiner quadruple systems, Utilitas Mathematica 51 (1997), 33–39.MATHMathSciNetGoogle Scholar
  42. [42]
    B.M. Maenhaut, On the volume of 5-cycle trades, Graphs and Cornbinatorics 17 (2001), 315–328.CrossRefMATHMathSciNetGoogle Scholar
  43. [43]
    E.S. Mahmoodian and M. Mirzakhani, Decomposition of complete tripartite graphs into 5-cycles, in Combinatorics Advances (eds. C.J. Colbourn and E.S. Mahmoodian), Kluwer Academic Publishers (1995), 235–241.CrossRefGoogle Scholar
  44. [44]
    S. Milici and G. Quattrocchi, On the intersection problem for three Steiner triple systems. Ars Combinatoria 24A (1987), 174–194.MathSciNetGoogle Scholar
  45. [45]
    C. Ramsay, An algorithm for enumerating trades in designs, with an application to defining sets, J. Combin. Math. Combin. Comput. 24 (1997), 3–31.MATHMathSciNetGoogle Scholar
  46. [46]
    C. Ramsay, On the index of simple trades, Australasian Journal of Combinatorics 20 (1999), 207–221.MATHMathSciNetGoogle Scholar
  47. [47]
    N. Soltankhah, On directed trades, Australas. J. Combin. 11 (1995), 59–66.MATHMathSciNetGoogle Scholar
  48. [48]
    A.P. Street, A survey of rreducible balanced incomplete block designs, Ars Combinatoria 19A (1985), 43–60.MATHMathSciNetGoogle Scholar
  49. [49]
    A.P. Street, Trades and defining sets, in C.J. Clbourn and J.H. Dinitz, CRC Handbook of Combinatorial Designs, CRC Publishing Co., IV.46 (1996), 474–478.Google Scholar
  50. [50]
    H.S. White, F.N. Cole and L.D. Cummings, Complete classification of the triad systems on fifteen elements, Memoirs of the National Academy of Sciences 14 (1916), 1–189.Google Scholar
  51. [51]
    N. Wormald, private communication, 2001.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Elizabeth J. Billington
    • 1
  1. 1.Department of MathematicsThe University of QueenslandBrisbaneAustralia

Personalised recommendations