zbMATH — the first resource for mathematics

Uniformly resolvable pairwise balanced designs with blocksizes two and three. (English) Zbl 0659.05016
A uniformly resolvable pairwise balanced design is a pairwise balanced design whose blocks can be resolved into parallel classes in such a way that all blocks in a given parallel class have the same size. We are concerned here with designs in which each block has size two or three, and we prove that the obvious necessary conditions on the existence of such designs are also sufficient, with two exceptions, corresponding to the non-existence of nearly Kirkman triple systems of orders 6 and 12.

05B05 Combinatorial aspects of block designs
05B07 Triple systems
Full Text: DOI
[1] Baker, R.D; Wilson, R.M, Nearly kirkman triple systems, Utilitas math., 11, 289-296, (1977) · Zbl 0362.05030
[2] Brouwer, A.E, Two new nearly kirkman triple systems, Utilitas math., 13, 311-314, (1978) · Zbl 0379.05008
[3] Doyen, J; Wilson, R.M, Embeddings of Steiner triple systems, Discrete math., 5, 229-239, (1973) · Zbl 0263.05017
[4] Hanani, H; Ray-Chaudhuri, D.K; Wilson, R.M, On resolvable designs, Discrete math., 3, 343-357, (1972) · Zbl 0263.05016
[5] Huang, C; Mendelsohn, E; Rosa, A, On partially resolvable t-partitions, Ann. discrete math., 12, 169-183, (1982) · Zbl 0495.05013
[6] Kotzig, A; Rosa, A, Nearly kirkman systems, (), 607-614
[7] Ray-Chaudhuri, D.K; Wilson, R.M, Solution of Kirkman’s schoolgirl problem, (), 187-204 · Zbl 0248.05009
[8] \scR. Rees and D. R. Stinson, On resolvable group-divisible designs with blocksize 3, Ars. Combin., to appear. · Zbl 0621.05004
[9] Rees, R; Wallis, W.D; Rees, R; Wallis, W.D, A class of resolvable pairwise balanced designs, (), 211-220 · Zbl 0611.05008
[10] \scD. R. Stinson, Frames for Kirkman Triple Systems, Discrete Math., to appear. · Zbl 0651.05015
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.