The Steiner triple systems of order 19

DOI10.1090/S0025-5718-04-01626-6zbMath1043.05020MaRDI QIDQ4813625

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

Publication date: 13 August 2004

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

zbMATH Keywords

automorphism groupstrongly regular graphsorderly algorithmSteiner triple systemsPasch configurations

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graph theory (including graph drawing) in computer science (68R10) Steiner systems in finite geometry (51E10) Triple systems (05B07)

Related Items

On the number of Steiner triple systems \(S(2^m - 1, 3, 2)\) of rank \(2^m - m + 2\) over \(\mathbb{F}_2\), Switching 3-edge-colorings of cubic graphs, The Steiner quadruple systems of order 16, Switching for Small Strongly Regular Graphs, Orthogonal representations of Steiner triple system incidence graphs, Computational complexity of reconstruction and isomorphism testing for designs and line graphs, 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)\), Enumeration of Latin squares with conjugate symmetry, Bussey systems and Steiner's tactical problem, Steiner triple systems of order 21 with subsystems, Sparse Steiner triple systems of order 21, Association schemes with given stratum dimensions: on a paper of Peter M. Neumann, On triple systems and strongly regular graphs, Steiner triple systems of order 19 and 21 with subsystems of order 7, Switching codes and designs, The cycle switching graph of the Steiner triple systems of order 19 is connected, Steiner triple systems satisfying the 4-vertex condition, The Mendelsohn Triple Systems of Order 13, There exist non‐isomorphic STS(19) with equivalent point codes, There exists no Steiner system \(S(4,5,17)\), Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19, Distance and fractional isomorphism in Steiner triple systems, Classification of simple 2-(11,3,3) designs, Kirkman triple systems with subsystems, Enumeration of Steiner triple systems with subsystems, Basics of DTS quasigroups: Algebra, geometry and enumeration, The centre of a Steiner loop and the maxi-Pasch problem

Uses Software

• nauty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• The solution of van der Waerden's problem for permanents
• Some results on quadrilaterals in Steiner triple systems
• Fundamental algorithms for permutation groups
• Nonisomorphic Steiner triple systems
• Strongly regular graphs, partial geometries and partially balanced designs
• Determination of Steiner Triple Systems of Order 15
• 2000000 Steiner Triple Systems of Order 19
• 284457 Steiner Triple Systems of Order 19 Contain a Subsystem of Order 9
• Steiner triple systems of order 19 with nontrivial automorphism group
• Isomorph-Free Exhaustive Generation
• A small basis for four‐line configurations in steiner triple systems. Dedicated to the memory of gemma holly griggs