Enumerating Steiner triple systems

DOI10.1002/jcd.21906zbMath1526.05008arXiv2303.01207OpenAlexW4384131161MaRDI QIDQ6064438

Daniel Heinlein, Patric R. J. Östergård

Publication date: 9 November 2023

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.01207

zbMATH Keywords

classificationSteiner triple systemcountingregular graph

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Triple systems (05B07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kirkman triple systems with subsystems
• 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
• Cyclically resolvable cyclic Steiner triple systems of order 21 and 39
• There is no McLaughlin geometry
• Steiner triple systems of order 21 with a transversal subdesign \(\mathrm{TD}(3, 6)\)
• Practical graph isomorphism. II.
• Kirkman triple systems of order 21 with nontrivial automorphism group
• The number of Latin squares of order 11
• A remark on the existence of finite graphs
• Small latin squares, quasigroups, and loops
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A Class of Steiner Triple Systems of Order 21 and Associated Kirkman Systems
• Fast generation of regular graphs and construction of cages
• The Steiner triple systems of order 19
• Fast generation of cubic graphs
• The Generation of Fullerenes
• Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms
• Enumeration of Steiner triple systems with subsystems
• Computing and Combinatorics