论文信息 - Blocking sets and colouring in Steiner systems S(2,4,ν) - 字舞流文

Blocking sets and colouring in Steiner systems S(2,4,ν)

A Steiner system S(2, 4, v) is a v -element set V together with a collection B of 4-subsets of V called blocks such that every 2-subset of V is contained in exactly one block.

[1] H. Hanani. The Existence and Construction of Balanced Incomplete Block Designs , 1961 .

[2] Christopher A. Rodger,et al. Existence of certain skew room frames with application to weakly 3-chromatic linear spaces , 1994 .

[3] Kevin T. Phelps,et al. Blocking sets in designs with block size four II , 1991, Discret. Math..

[4] Chen Kejun,et al. On the existence of skew room frames of type t^u , 1996, Ars Comb..

[5] Terry S. Griggs,et al. Completing the spectrum of 2-chromatic S(2, 4, v) , 2002, Discret. Math..

[6] Vitaly I. Voloshin,et al. Colouring Steiner systems with specified block colour patterns , 2001, Discret. Math..

[7] A. Ling. Hyperovals in Steiner systems , 2003 .

[8] Vitaly I. Voloshin,et al. Bicolouring Steiner systems S(2, 4, v) , 2004, Discret. Math..

[9] Vojtech Rödl,et al. Note on Independent Sets in Steiner Systems , 1994, Random Struct. Algorithms.

[10] Malcolm Greig,et al. Maximal arcs in Steiner systems S(2, 4, v) , 2003, Discret. Math..

[11] Vojtech Rödl,et al. The minimum independence number for designs , 1995, Comb..

[12] Kevin T. Phelps,et al. Blocking Sets in Designs with Block Size 4 , 1990, Eur. J. Comb..