Steiner triple systems satisfying the 4-vertex condition

DOI10.1007/s10623-011-9520-2zbMath1236.05034OpenAlexW2003743811MaRDI QIDQ664381

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

Publication date: 1 March 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-011-9520-2

zbMATH Keywords

Steiner triple system4-Vertex conditionStrongly regular graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Triple systems (05B07)

Related Items (2)

On highly regular strongly regular graphs ⋮ Strongly regular graphs with the \(7\)-vertex condition

Uses Software

• libexact

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification algorithms for codes and designs
• Two families of strongly regular graphs with the 4-vertex condition
• A criterion for the \(t\)-vertex condition of graphs
• One-factorizations of regular graphs of order 12
• Strongly regular graphs, partial geometries and partially balanced designs
• The Steiner triple systems of order 19

This page was built for publication: Steiner triple systems satisfying the 4-vertex condition