Nonisomorphic Steiner triple systems

DOI10.1007/BF01215371zbMath0264.05009OpenAlexW2011210618WikidataQ106165255 ScholiaQ106165255MaRDI QIDQ2561593

Richard M. Wilson

Publication date: 1974

Published in: Mathematische Zeitschrift (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/172016

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30)

Related Items

Some results on defining sets of t-designs, Counting Steiner triple systems, Almost all linear spaces and partial \(t\)-designs have trivial automorphism groups, Recursive constructions for triangulations, Cartesian lattice counting by the vertical 2-sum, On Nonisomorphic Room Squares, The Steiner triple systems of order 19, Rigid Steiner Triple Systems Obtained from Projective Triple Systems, On distance-regular graphs with smallest eigenvalue at least \(- m\), Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+1\) over \(\mathbb F_2\), Geometric distance-regular graphs without 4-claws, On the Wilson monoid of a pairwise balanced design, Steiner triple systems of order 21 with a transversal subdesign \(\mathrm{TD}(3, 6)\), Steiner triple systems with rotational automorphisms, On the number of edge-colourings of regular bipartite graphs, Steiner triple systems of order 19 and 21 with subsystems of order 7, The counting version of a problem of Erdős, Coloured and Directed Designs, A survey of Kirkman triple systems and related designs, Thresholds versus fractional expectation-thresholds, Random strongly regular graphs?, On the number of 1-factorizations of the complete graph, An existence theory for pairwise balanced designs. III: Proof of the existence conjectures, Maximum genus embeddings of Steiner triple systems, On the number of partial Steiner systems, Random strongly regular graphs?, A mass formula for Steiner triple systems STS\((2^n-1)\) of 2-rank \(2^n-n\), Spanning trees of 3-uniform hypergraphs, Enumeration of the doubles of the projective plane of order 4, Distance-regular graphs without 4-claws, Exponential families of non-isomorphic triangulations of complete graphs, Bi-embeddings of the projective space PG(3, 2), The family of t-designs. II, A generalisation of \(t\)-designs, On the number of Mendelsohn and transitive triple systems, An upper bound on the number of Steiner triple systems, On the bi-embeddability of certain Steiner triple systems of order 15

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of non isomorphic Steiner triple systems
• Embeddings of Steiner triple systems
• Determination of Steiner Triple Systems of Order 15
• The number of latin squares of order eight
• Sur la croissance du nombre de systèmes triples de Steiner non lsomorphes