Super‐simple holey Steiner pentagon systems and related designs

A Steiner pentagon system of order v (SPS(v)) is said to be super-simple if its underlying (v, 5, 2)-BIBD is super-simple; that is, any two blocks of the BIBD intersect in at most two points. It is well known that the existence of a holey Steiner pentagon system (HSPS) of type T implies the existence of a (5, 2)-GDD of type T. We shall call an HSPS of type T super-simple if its underlying (5, 2)-GDD of type T is super-simple; that is, any two blocks of the GDD intersect in at most two points. The existence of HSPSs of uniform type hn has previously been investigated by the authors and others. In this article, we focus our attention on the existence of super-simple HSPSs of uniform type hn. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 301–328, 2008

[1]  R. Julian R. Abel,et al.  Perfect Mendelsohn Packing Designs with Block Size Five , 1998, Des. Codes Cryptogr..

[2]  Jianxing Yin,et al.  Existence of directed GDDs with block size five and index λ⩾2 , 2000 .

[3]  Iliya Bluskov,et al.  New upper bounds on the minimum size of covering designs , 1998 .

[4]  Frank E. Bennett,et al.  Existence of HPMDs with block size five , 1997 .

[5]  Kevin T. Phelps,et al.  Constructions of perfect Mendelsohn designs , 1992, Discret. Math..

[6]  Ge Gennian,et al.  On the existence of room frames of type tu for u = 4 and 5 , 1993 .

[7]  Rolf S. Rees,et al.  Group‐divisible designs with block size k having k + 1 groups, for k = 4, 5 , 2000 .

[8]  Nabil Shalaby,et al.  Existence of directed GDDs with block size five , 1998 .

[9]  Gennian Ge,et al.  Holey Steiner pentagon systems and related designs , 2002 .

[10]  Charles J. Colbourn,et al.  The existence of uniform 5‐GDDs , 1997 .

[11]  Douglas R. Stinson,et al.  Steiner pentagon systems , 1984, Discret. Math..

[12]  Gennian Ge,et al.  Authentication perpendicular arrays APA1(2, 5, v) , 1996 .

[13]  Gennian Ge,et al.  Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs , 2005 .

[14]  Frank E. Bennett,et al.  Holey Steiner pentagon systems , 1999 .

[15]  Donald L. Kreher,et al.  Super-simple (v, 5, 2)-designs , 2004, Discret. Appl. Math..

[16]  Vladimir S. Lebedev,et al.  On optimal superimposed codes , 2004 .

[17]  Sven Hartmann,et al.  On Orthogonal Double Covers of Graphs , 2002, Des. Codes Cryptogr..

[18]  Ruizhong Wei,et al.  Super-simple (v, 5, 4) designs , 2007, Discret. Appl. Math..

[19]  Charles J. Colbourn,et al.  Quintessential pairwise balanced designs , 1998 .

[20]  Gennian Ge,et al.  Some more 5-GDDs and optimal (v), 5, 1)-packings , 2004 .

[21]  Frank E. Bennett,et al.  Quintessential PBDs and PBDs with prime power block sizes ≥ 8 , 2005 .