Steiner triple systems of order 21 with subsystems
From MaRDI portal
Publication:6146847
DOI10.3336/gm.58.2.06arXiv2104.06825MaRDI QIDQ6146847
Daniel Heinlein, Patric R. J. Östergård
Publication date: 31 January 2024
Published in: Glasnik Matematicki (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.06825
Cites Work
- 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
- Most Latin squares have many subsquares
- Cyclically resolvable cyclic Steiner triple systems of order 21 and 39
- One-factorizations of regular graphs of order 12
- Counting symmetric configurations \(v_3\)
- Practical graph isomorphism. II.
- Kirkman triple systems of order 21 with nontrivial automorphism group
- Almost all Steiner triple systems have perfect matchings
- 284457 Steiner Triple Systems of Order 19 Contain a Subsystem of Order 9
- Algebraic Speculations About Steiner Systems
- Almost All Steiner Triple Systems Are Asymmetric
- 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
- Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms
- Enumeration of Steiner triple systems with subsystems
- Sparse Steiner triple systems of order 21
This page was built for publication: Steiner triple systems of order 21 with subsystems