A collection of subsets (called blocks) of a fixed vertex set (possibly with repetition) is called a (t,, tn-1 ..... tl ; am, am-1 ..... al)-design if it satisfies certain regularity conditions on the number of blocks which contain subsets of the vertex set of certain size, and other regularity cond
One-factors and the existence of affine designs
โ Scribed by Neal Brand; Somporn Sutinuntopas
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 582 KB
- Volume
- 120
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
One-factors and the existence of affine designs, Discrete Mathematics 120 (1993) 25-35. Kiihler (1982) defines a graph G, for p a prime which he relates to affine designs. He shows that if the graph has a l-factor then there exists an affine 3-(p, 4, %) design with 1, satisfying the usual necessary conditions. Here we generalize Kiihler's results to include finite fields. M= ~ BiUi i=l in Q(A) is called a multiset over A, and pi is the multiplicity of Ui in M. If each Ui has the same multiplicity 2 in M, we may write M = ,%A. Let V be a v-set and Y be any positive integer less than u. We denote the collection of all r-subsets of V by (I', r). Definition 1.1. The multiset g =Cr= 1 fi<Bi over the set (V, k) is a t-(u, k, 2) design if
๐ SIMILAR VOLUMES
We classify the doubly transitive affine designs. The proof uses the classification of the multiply transitive permutation groups.
## Abstract In this note, a golf design of order 41 is constructed. Combined Colbourn and Nonay's result, the existence spectrum of golf design of order ฯ is the set {ฯ : ฯ โก1 (mod 2), ฯ โโฅโ3, ฯ โโ โ5}. ยฉ 2005 Wiley Periodicals, Inc. J Combin Designs 15: 84โ89, 2007