On resolvable designs \(S_ 3(3;4,v)\)
type: Item
instance of: scholarly article
title: On resolvable designs \(S_ 3(3;4,v)\)
zbMATH Open document ID: 0648.05007
DOI: 10.1016/0097-3165(86)90073-7
author: Dieter Jungnickel
author: Scott A. Vanstone
published in: Journal of Combinatorial Theory. Series A
publication date: 1986-01-01T00:00:00Z
review text: We study a method of Lonz and Vanstone which constructs an \(S_ 3(3,4,2n)\) from any given 1-factorization of \(K_{2n}\). We show that the resulting designs admit at least 3 mutually orthogonal resolutions whenever \(n\geq 4\) is even. In particular, the necessary conditions for the existence of a resolvable \(S_ 3(3,4,v)\) are also sufficient. Examples without repeated blocks are shown to exist provided that \(n\not\equiv 2\) mod 3.
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 4057519
zbMATH Keywords: resolvability
zbMATH Keywords: designs
zbMATH Keywords: mutually orthogonal resolutions
MaRDI profile type: Publication
full work available at URL: 0097-3165(86)90073-7
OpenAlex ID: W2395091652
cites work: Einige einfache fahnenhomogene 3-Blockpläne
cites work: Q3686719
cites work: The spectrum of Room cubes
cites work: Q5181706
cites work: On Some Tactical Configurations
cites work: Cyclic one-factorization of the complete graph
cites work: Room designs and one-factorizations
cites work: Q3781132
cites work: k-difference-cycles and the construction of cyclic t-designs
description: scientific article; zbMATH DE number 4057519