The existence of resolvable Steiner quadruple systems
From MaRDI portal
Publication:1114691
DOI10.1016/0097-3165(87)90028-8zbMath0663.05010OpenAlexW2082134848MaRDI QIDQ1114691
Publication date: 1987
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(87)90028-8
Related Items (20)
Constructions of doubly resolvable Steiner quadruple systems ⋮ Egalitarian Steiner quadruple systems of doubly even order ⋮ Existence of resolvable H-designs with group sizes 2, 3, 4 and 6 ⋮ Doubly resolvable Steiner quadruple systems and related designs ⋮ Spectrum of resolvable directed quadruple systems ⋮ On resolvability of Steiner systems \(S ( v = 2^{ m }, 4, 3)\) of rank \(r \leq v - m + 1\) over \(\mathbb{F}_{2}\) ⋮ Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions ⋮ \((1,2)\)-resolvable candelabra quadruple systems and Steiner quadruple systems ⋮ Unifying some known infinite families of combinatorial 3-designs ⋮ Doubly resolvable Steiner quadruple systems of orders \(2^{2n+1}\) ⋮ H-designs with the properties of resolvability or (1, 2)-resolvability ⋮ Egalitarian Steiner triple systems for data popularity ⋮ Doubly resolvable H designs ⋮ Maximal resolvable packings and minimal resolvable coverings of triples by quadruples ⋮ The last twenty orders of (1,2)-resolvable Steiner quadruple systems ⋮ The existence of augmented resolvable Steiner quadruple systems ⋮ On one transformation of Steiner quadruple systems \(S(\upsilon , 4, 3)\) ⋮ Construction of minimum generalized aberration designs ⋮ Resolvable candelabra quadruple systems with three groups ⋮ Uniformly resolvable three-wise balanced designs with block sizes four and six
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Resolvable BIBD and SOLS
- A general recursive construction for quadruple systems
- On resolvable balanced incomplete block designs
- Every generalized Petersen graph has a Tait coloring
- On resolvable designs
- On Quadruple Systems
- Construction and resolution of quadruple systems
This page was built for publication: The existence of resolvable Steiner quadruple systems