Designs, Codes and Cryptography

, Volume 62, Issue 3, pp 323–330 | Cite as

Steiner triple systems satisfying the 4-vertex condition

  • Petteri Kaski
  • Mahdad Khatirinejad
  • Patric R. J. Östergård


Higman asked which block graphs of Steiner triple systems of order v satisfy the 4-vertex condition and left the cases v = 9, 13, 25 unsettled.We give a complete answer to this question by showing that the affine plane of order 3 and the binary projective spaces are the only such systems. The major part of the proof is to show that no block graph of a Steiner triple system of order 25 satisfies the 4-vertex condition.


4-Vertex condition Steiner triple system Strongly regular graph 

Mathematics Subject Classification (2000)

05B07 05E30 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bose R.C.: Strongly regular graphs, partial geometries and partially balanced designs. Pacific J. Math. 13, 389–419 (1963)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Brouwer A.E.: Strongly regular graphs. In: Colbourn, C.J., Dinitz, J.H. (eds) Handbook of Combinatorial Designs, 2nd edn., pp. 852–868. Chapman, Hall/CRC, Boca Raton (2007)Google Scholar
  3. 3.
    Brouwer A.E., Cohen A.M., Neumaier A.: Distance-Regular Graphs. Springer-Verlag, Berlin (1989)zbMATHGoogle Scholar
  4. 4.
    Colbourn C.J., Rosa A.: Triple Systems. Oxford University Press, Oxford (1999)zbMATHGoogle Scholar
  5. 5.
    Hestenes M.D., Higman D.G.: Rank 3 groups and strongly regular graphs. In: Computers in Algebra and Number Theory (Proceedings of the SIAM-AMS Symposium in Applied Mathematics, New York, 1970), pp. 141–159. SIAM-AMS Proceedings, vol. IV. American Mathematical Society, Providence, RI (1971).Google Scholar
  6. 6.
    Higman D.G.: Partial geometries, generalized quadrangles and strongly regular graphs. In: Atti del Convegno di Geometria Combinatoria e sue Applicazioni (Univ. Perugia, Perugia, 1970), pp. 263–293. Ist. Mat., Univ. Perugia, Perugia (1971).Google Scholar
  7. 7.
    Hirschfeld J.W.P.: Projective Geometries Over Finite Fields, 2nd edn. Clarendon Press, Oxford University Press, New York (1998)zbMATHGoogle Scholar
  8. 8.
    Ivanov A.V.: Two families of strongly regular graphs with the 4-vertex condition. Discret. Math. 127, 221–242 (1994)zbMATHCrossRefGoogle Scholar
  9. 9.
    Kaski P., Östergård P.R.J.: The Steiner triple systems of order 19. Math. Comput. 73, 2075–2092 (2004)zbMATHCrossRefGoogle Scholar
  10. 10.
    Kaski P., Östergård P.R.J.: One-factorizations of regular graphs of order 12. Electron. J. Comb. 12, #R2 (2005).Google Scholar
  11. 11.
    Kaski P., Östergård P.R.J.: Classification Algorithms for Codes and Designs. Springer-Verlag, Berlin (2006)zbMATHGoogle Scholar
  12. 12.
    Kaski P., Pottonen O.: libexact User’s Guide, Version 1.0. HIIT Technical Reports 2008–2011, Helsinki Institute for Information Technology HIIT (2008).Google Scholar
  13. 13.
    Klin M., Meszka M., Reichard S., Rosa A.: The smallest non-rank 3 strongly regular graphs which satisfy the 4-vertex condition. Bayreuth. Math. Schr. 74, 145–205 (2005)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Knuth D.E.: Dancing links. In: Davies, J., Roscoe, B., Woodcock, J. (eds) Millennial Perspectives in Computer Science., pp. 187–214. Palgrave Macmillan, Basingstoke (2000)Google Scholar
  15. 15.
    Mathon R., Rosa A.: 2-(v, k, λ) designs of small order. In: Colbourn, C.J., Dinitz, J.H. (eds) Handbook of Combinatorial Designs, 2nd edn., pp. 25–58. Chapman, Hall/CRC, Boca Raton (2007)Google Scholar
  16. 16.
    Reichard S.: A criterion for the t-vertex condition of graphs. J. Comb. Theory Ser. A 90, 304–314 (2000)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Petteri Kaski
    • 1
  • Mahdad Khatirinejad
    • 2
    • 3
  • Patric R. J. Östergård
    • 2
  1. 1.Department of Information and Computer Science, Helsinki Institute of Information Technology HIITAalto UniversityAaltoFinland
  2. 2.Department of Communications and NetworkingAalto UniversityAaltoFinland
  3. 3.Department of MathematicsUniversity of British ColumbiaVancouverCanada

Personalised recommendations