The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
type: Item
instance of: scholarly article
title: The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
zbMATH Open document ID: 0702.05011
DOI: 10.1016/0012-365X(90)90179-L
published in: Discrete Mathematics
publication date: 1990-01-01T00:00:00Z
review text: A (1,2)-factorization of the complete graph \(K_ n\) is a partition P of the edges of \(K_ n\) into edges and triangles, and a partition T of P into k subsets, called (1,2)-factors, each of which partitions the vertices of \(K_ n\). When all members of P are edges, this is a one- factorization; when all members are triangles, this is a Kirkman triple system. The author addresses the question: for which integers \(n>0\) and \(\lfloor n/2\rfloor \leq k\leq n\) does \(K_ n\) admit a (1,2)-factorization with k (1,2)-factors. Part I settles this problem completely for n even, showing that except when \(n=6\), \(k=3\) or \(n=12\), \(k=6\), such a (1,2)- factorization exists provided the obvious arithmetic conditions are met. The proof is recursive, using powerful methods involving frames. Part II treats the apparently more complicated case when n is odd (cf. below). Here in addition to obvious arithmetic conditions, one requires that one of the following holds: 1. \(n\equiv 3(mod 6)\) and \(k=(n-1)/2\); 2. \(n=9\) and \(k=6\); or 3. \((n+1)/2\leq k\leq n-4\). The author settles the existence of (1,2)-factorizations for odd n, leaving eighteen orders unsettled (the largest being 89). The author [``The spectrum of restricted resolvable designs with \(r=2''\), Discrete Math., to appear] has since completed the determination for all orders.
Mathematics Subject Classification ID: 05B05
zbMATH DE Number: 4150165
zbMATH Keywords: factorization
zbMATH Keywords: resolvable designs
Wikidata QID: Q114215626
author: R. S. Rees
MaRDI profile type: Publication
cites work: Q4135564
cites work: Q4159380
cites work: Q5592263
cites work: On balanced incomplete block designs with blocks having five elements
cites work: On resolvable designs
cites work: Q4068738
cites work: Q3778769
cites work: One-factorizations of the complete graph—A survey
cites work: Q3932990
cites work: Q3922720
cites work: Q5661892
cites work: Minimal clique partitions and pairwise balanced designs
cites work: Uniformly resolvable pairwise balanced designs with blocksizes two and three
cites work: Q3798689
cites work: Frames and the \(g^{(k)}(v)\) problem
cites work: Q3757923
cites work: On the number of blocks in a perfect covering of v points
cites work: Q3751585
cites work: Q3717066
cites work: Q3929754
cites work: Q3966151
cites work: Q4742790
cites work: Frames for Kirkman triple systems
full work available at URL: 0012-365x(90)90179-l
OpenAlex ID: W4213057163
description: scientific article; zbMATH DE number 4150165