The existence of Kirkman squares-doubly resolvable (v, 3, 1)-BIBDs

Charles Colbourn, E. R. Lamken, Alan C H Ling, W. H. Mills

Research output: Contribution to journalArticlepeer-review

36 Scopus citations


A Kirkman square with index γ, latinicity μ, block size k, and v points, KSk(v; μ, γ), is a t × t array (t = γ(v - 1)/μ(k - 1)) defined on a v-set V such that (1) every point of V is contained in precisely μ 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 non-empty cells of the array is a (v, k, γ)-BIBD. For μ = 1, the existence of a KSk (v; μ, γ) is equivalent to the existence of a doubly resolvable (v, k, γ)-BIBD. The spectrum of KS2(v; 1, 1) or Room squares was completed by Mullin and Wallis in 1975. In this paper, we determine the spectrum for a second class of doubly resolvable designs with γ = 1. We show that there exist KS3(v; 1, 1) for v ≡ 3 (mod 6), v = 3 and v ≥ 27 with at most 23 possible exceptions for v.

Original languageEnglish (US)
Pages (from-to)169-196
Number of pages28
JournalDesigns, Codes, and Cryptography
Issue number1-3
StatePublished - 2002


  • Doubly resolvable
  • Kirkman square
  • Kirkman triple system
  • Resolvable
  • Steiner triple system

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'The existence of Kirkman squares-doubly resolvable (v, 3, 1)-BIBDs'. Together they form a unique fingerprint.

Cite this