J Austral Math Soc Ser A 44 pp33--41, 1988.
(Received 15 August 1985; revised 20 January 1986)
A Kirkman square with index l, latinicity m, block size k and v points, KSk(v; m, l), is a t ×t array (t = l(v - 1)/m(k - 1)) defined on a v-set V such that (1) each point of V is contained in precisely m cells of each row and column, (2) each cell of the array is either empty or contains a k-subset of V, and (3) the collection of blocks obtained from the nonempty cells of the array is a (v, k, l)-BIBD. For m = 1, the existence of a KSk(v; m, l) is equivalent to the existence of a doubly resolvable (v, k, l)-BIBD. In this case the only complete results are for k = 2. The case k = 3, l = 1 appears to be quite difficult although some existence results are available. For k = 3, l = 2 the problem seems to be more tractable. In this paper we prove the existence of a KS3(v; 1, 2) for all v º 3 (mod 12).
1980 AMS Subject Classification: 05B30
Last Modified: Wed Feb 19 10:27:48 2003