Skip to main content
Log in

Distance and fractional isomorphism in Steiner triple systems

  • Published:
Rendiconti del Circolo Matematico di Palermo Aims and scope Submit manuscript

Abstract

In [8], Quattrochi and Rinaldi introduced the idea ofn −1-isomorphism between Steiner systems. In this paper we study this concept in the context of Steiner triple systems. The main result is that for any positive integerN, there existsv 0(N) such that for all admissiblevv 0(N) and for each STS(v) (sayS), there exists an STS(v) (sayS′) such that for somen>N, S is strictlyn −1-isomorphic toS′. We also prove that for all admissiblev≥13, there exist two STS(v)s which are strictly 2−1-isomorphic.

Define the distance between two Steiner triple systemsS andS′ of the same order to be the minimum volume of a tradeT which transformsS into a system isomorphic toS′. We determine the distance between any two Steiner triple systems of order 15 and, further, give a complete classification of strictly 2−1-isomorphic and 3−1-isomorphic pairs of STS(15)s.

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. Colbourn C. J., Hoffman D. G., Rees R. S.,A new class of group divisible designs with block size three, J. Combin. Theory Ser. A,59 (1992), 73–89.

    Article  MATH  MathSciNet  Google Scholar 

  2. Colbourn C. J., Rosa A.,Triple Systems, Oxford University Press, New York 1999.

    MATH  Google Scholar 

  3. Forbes A. D., Grannell M. J., Griggs T. S.,Configurations and trades in Steiner triple systems, Australas. J. Combin.,29 (2004), 75–84.

    MATH  MathSciNet  Google Scholar 

  4. Kaski P., Östergård P. R. J.,The Steiner triple systems of order 19, Math. Comp.,73, no. 248, (2004), 2075–2092.

    Article  MATH  MathSciNet  Google Scholar 

  5. Kirkman T. P.,On a problem in combinatorics, Cambridge and Dublin Math. J.,2 (1847), 191–204.

    Google Scholar 

  6. Lindner C. C., Rosa A.,Steiner triple systems having a prescribed number of triples in common, Canad. J. Math.,27 (1975), 1166–1175. Corrigendum:30 (1978), 896.

    MATH  MathSciNet  Google Scholar 

  7. Moore E. H.,Concerning triple systems, Math. Ann.,43 (1893), 271–285.

    Article  MathSciNet  Google Scholar 

  8. Quattrocchi G., Rinaldi G.,Steiner systems and n −1-isomorphisms, J. Geom.,58 (1997), 146–157.

    Article  MATH  MathSciNet  Google Scholar 

  9. Ramana M. V., Scheinermann E. R., Ullman D.,Fractional isomorphism of graphs, Discrete Math.,132 (1994) 247–265.

    Article  MATH  MathSciNet  Google Scholar 

  10. Stinson D. R.,Hill-climbing algorithms for the construction of combinatorial designs, Ann. Discrete Math.,26 (1995), 311–334.

    Google Scholar 

  11. Wilson R. M.,Nonisomorphic Steiner triple systems, Math. Z.,135 (1974), 303–313.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. D. Forbes.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Forbes, A.D., Grannell, M.J. & Griggs, T.S. Distance and fractional isomorphism in Steiner triple systems. Rend. Circ. Mat. Palermo 56, 17–32 (2007). https://doi.org/10.1007/BF03031425

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS Classification

Keyswords

Navigation