Recursive constructions for cyclic block designs
β Scribed by Marlene J. Colbourn; Charles J. Colbourn
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 414 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0378-3758
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A (Ξ½, __k__, __k__β1) near resolvable block design (NRBD) is __r__βrotational over a group __G__ if it admits __G__ as an automorphism group of order (Ξ½β1)/__r__ fixing exactly one point and acting semiregularly on the others. We give direct and recursive constructions for rotational NR
## Abstract Three recursive constructions are presented; two deal with embeddings of complete graphs and one with embeddings of complete tripartite graphs. All three facilitate the construction of 2) nonβisomorphic face 2βcolourable triangulations of __K__~n~ and __K__~__n,n,n__~ in orientable and
This paper gives some recursive constructions for cyclic 3-designs. Using these constructions we improve Grannell and Griggs's construction for cyclic Steiner quadruple systems, and many known recursive constructions for cyclic Steiner quadruple systems are unified. Finally, some new infinite famili