Resolvable perfect Mendelsohn designs with block size five

  • Authors:

  • R. J. R. Abel;F. E. Bennett;G. Gec

  • Affiliations:

  • School of Mathematics, University of New South Wales, Kensington, N.S.W. 2033, Australia;Department of Mathematics, Mount Saint Vincent University, Halifax, Nova Scotia, Canada;Department of Mathematics, Suzhou University, Suzhou 215006, People's Republic of China

  • Venue:
  • Discrete Mathematics
  • Year:
  • 2002

Quantified Score

Hi-index 0.05

Visualization

Abstract

A necessary condition for the existence of a resolvable (v, 5, 1 )-perfect Mendelsohn design is v ≡ 0 (mod 5). This condition is shown to be sufficient for v ≥ 215, with two known exceptions plus at most 17 possible exceptions below this value.