On the number of disjoint Mendelsohn triple systems
From MaRDI portal
Publication:1163024
DOI10.1016/0097-3165(81)90028-5zbMath0483.05015OpenAlexW1998303839MaRDI QIDQ1163024
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(81)90028-5
Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (14)
Construction of large sets of pairwise disjoint transitive triple systems. II ⋮ The construction of large sets of idempotent quasigroups ⋮ Large sets of three types of oriented triple systems ⋮ Large sets of resolvable Mendelsohn triple systems of prime power sizes ⋮ Derived Mendelsohn triple systems ⋮ Large sets of resolvable idempotent Latin squares ⋮ The existence of r‐golf designs ⋮ New large sets of resolvable Mendelsohn triple systems ⋮ The construction of large sets of disjoint Mendelsohn triple systems of order \(2^ n + 2\) ⋮ Further results about large sets of disjoint Mendelsohn triple systems ⋮ The existence of \(r\)-large sets of Mendelsohn triple systems ⋮ Construction of large sets of pairwise disjoint transitive triple systems ⋮ On the number of Mendelsohn and transitive triple systems ⋮ Some recent developments on BIBDs and related designs
Cites Work
- Some packings with Steiner triple systems
- A theorem on the maximum number of disjoint Steiner triple systems
- Covering all triples on n marks by disjoint Steiner systems
- On the maximum number of disjoint Steiner triple systems
- Intersection Properties of Steiner Systems
- Constructions of Disjoint Steiner Triple Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the number of disjoint Mendelsohn triple systems
