Enumeration of Steiner triple systems with subsystems

DOI10.1090/mcom/2945zbMath1319.05023OpenAlexW1982451793MaRDI QIDQ5501161

Patric R. J. Östergård, Alexandru Popa, Petteri Kaski

Publication date: 13 August 2015

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/mcom/2945

zbMATH Keywords

classificationSteiner triple systemenumerationsubsystem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Steiner systems in finite geometry (51E10) Triple systems (05B07)

Related Items (4)

On the Wilson monoid of a pairwise balanced design ⋮ Enumerating Steiner triple systems ⋮ Steiner triple systems of order 21 with a transversal subdesign \(\mathrm{TD}(3, 6)\) ⋮ Steiner triple systems of order 21 with subsystems

Uses Software

• nauty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On triple systems and strongly regular graphs
• Classification algorithms for codes and designs
• Steiner triple systems of order 19 and 21 with subsystems of order 7
• Properties of the Steiner triple systems of order 19
• Applied finite group actions.
• One-factorizations of regular graphs of order 12
• Embeddings of Steiner triple systems
• There exists no (15,5,4) RBIBD†*
• The number of Latin squares of order 11
• Small latin squares, quasigroups, and loops
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• 284457 Steiner Triple Systems of Order 19 Contain a Subsystem of Order 9
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Isomorph-Free Exhaustive Generation
• The Steiner triple systems of order 19

This page was built for publication: Enumeration of Steiner triple systems with subsystems