Enumerating Steiner triple systems
From MaRDI portal
Abstract: Steiner triple systems (STSs) have been classified up to order 19. Earlier estimations of the number of isomorphism classes of STSs of order 21, the smallest open case, are discouraging as for classification, so it is natural to focus on the easier problem of merely counting the isomorphism classes. Computational approaches for counting STSs are here considered and lead to an algorithm that is used to obtain the number of isomorphism classes for order 21: 14,796,207,517,873,771.
Recommendations
- Counting Steiner triple systems
- Enumeration of Steiner triple systems with subsystems
- Tricyclic Steiner triple systems
- scientific article; zbMATH DE number 1284204
- scientific article; zbMATH DE number 5984452
- On the number of inequivalent steiner triple systems
- On Steiner and Similar Triple Systems.
- scientific article; zbMATH DE number 2057991
- Counting Steiner triple systems with classical parameters and prescribed rank
- scientific article; zbMATH DE number 1409201
Cites work
- A Class of Steiner Triple Systems of Order 21 and Associated Kirkman Systems
- A remark on the existence of finite graphs
- Classification algorithms for codes and designs
- Computing and Combinatorics
- Cyclically resolvable cyclic Steiner triple systems of order 21 and 39
- Enumeration of Steiner triple systems with subsystems
- Fast generation of cubic graphs
- Fast generation of regular graphs and construction of cages
- Generation of cubic graphs
- scientific article; zbMATH DE number 5984452 (Why is no real title available?)
- scientific article; zbMATH DE number 3853088 (Why is no real title available?)
- scientific article; zbMATH DE number 5130670 (Why is no real title available?)
- scientific article; zbMATH DE number 3987287 (Why is no real title available?)
- scientific article; zbMATH DE number 3735870 (Why is no real title available?)
- scientific article; zbMATH DE number 1314686 (Why is no real title available?)
- scientific article; zbMATH DE number 1089130 (Why is no real title available?)
- scientific article; zbMATH DE number 2192115 (Why is no real title available?)
- scientific article; zbMATH DE number 2233303 (Why is no real title available?)
- Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms
- Kirkman triple systems of order 21 with nontrivial automorphism group
- Kirkman triple systems with subsystems
- Nonexistence of perfect Steiner triple systems of order 19 and 21
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Practical graph isomorphism. II.
- Properties of the Steiner triple systems of order 19
- Small latin squares, quasigroups, and loops
- Steiner triple systems of order 19 and 21 with subsystems of order 7
- Steiner triple systems of order 21 with a transversal subdesign \(\mathrm{TD}(3, 6)\)
- The CRC handbook of combinatorial designs
- The number of Latin squares of order 11
- The Steiner triple systems of order 19
- There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14
- There is no McLaughlin geometry
Cited in
(11)- Triangle transitive Steiner triple systems
- scientific article; zbMATH DE number 5984452 (Why is no real title available?)
- Block-avoiding point sequencings of arbitrary length in Steiner triple systems
- scientific article; zbMATH DE number 4101197 (Why is no real title available?)
- scientific article; zbMATH DE number 1228449 (Why is no real title available?)
- scientific article; zbMATH DE number 6808054 (Why is no real title available?)
- scientific article; zbMATH DE number 6813593 (Why is no real title available?)
- Algorithms and complexity for counting configurations in Steiner triple systems
- Properties of Steiner triple systems of order 21
- On the number of small Steiner triple systems with Veblen points
- Halving Steiner triple systems
This page was built for publication: Enumerating Steiner triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064438)
