On resolvable designs \(S_ 3(3;4,v)\)

DOI10.1016/0097-3165(86)90073-7zbMath0648.05007OpenAlexW2395091652MaRDI QIDQ1104925

Scott A. Vanstone, Dieter Jungnickel

Publication date: 1986

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(86)90073-7

zbMATH Keywords

designsresolvabilitymutually orthogonal resolutions

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

Construction of 3-designs using \((1,\sigma)\)-resolution ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ Unifying some known infinite families of combinatorial 3-designs ⋮ A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs ⋮ Recursive constructions for 3-designs and resolvable 3-designs ⋮ The existence of simple \(S_ 3(3,4,\nu)\) ⋮ Steiner quadruple systems with point-regular abelian automorphism groups ⋮ Achromatic numbers of Kneser graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Einige einfache fahnenhomogene 3-Blockpläne
• The spectrum of Room cubes
• Cyclic one-factorization of the complete graph
• Room designs and one-factorizations
• k-difference-cycles and the construction of cyclic t-designs
• On Some Tactical Configurations

This page was built for publication: On resolvable designs \(S_ 3(3;4,v)\)