zbMATH — the first resource for mathematics

Frames for Kirkman triple systems. (English) Zbl 0651.05015
We introduce the idea of a ‘frame’ for a Kirkman triple system: loosely speaking, a frame is a Kirkman system with ‘holes’. We construct many frames for Kirkman triple systems. We then apply these frames to the construction of Kirkman triple systems with subsystems. We construct a system of order v containing a system of order w, for all admissible \(v\geq 4w-9\), with two exceptions.

05B05 Combinatorial aspects of block designs
Full Text: DOI
[1] A. Assaf, E. Mendelsohn and D.R. Stinson, On resolvable coverings of pairs by triples, Utilitas Math., to appear. · Zbl 0649.05024
[2] Baker, R.D; Wilson, R.M, Nearly kirkman triple systems, Utilitas math., 11, 289-296, (1977) · Zbl 0362.05030
[3] Brouwer, A.E; Hanani, H; Schrijver, A, Group divisible designs with block-size four, Discrete math., 20, 1-10, (1977) · Zbl 0371.62105
[4] Brouwer, A.E, Optimal packings of K4’s into a kn, J. combin. theory ser. A, 26, 278-297, (1979) · Zbl 0412.05030
[5] Brouwer, A.E, The number of mutually orthogonal Latin squares: a table up to order 10 000, () · Zbl 0405.05013
[6] Horton, J.D, Sub-Latin squares and incomplete orthogonal arrays, J. combin. theory ser. A, 16, 23-33, (1974) · Zbl 0297.05015
[7] Ray-Chaudhuri, D.K; Wilson, R.M, Solution of Kirkman’s school-girl problem, (), 187-204
[8] R. Rees and D.R. Stinson, On resolvable group-divisible designs with block-size 3, Ars Combin., to appear. · Zbl 0621.05004
[9] D.R. Stinson, The equivalence of certain incomplete transversal designs and frames, Ars Combin., to appear. · Zbl 0622.05012
[10] Wilson, R.M, Constructions and uses of pairwise balanced designs, Math. centre tracts, 55, 18-41, (1974) · Zbl 0312.05010
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.