论文信息 - Repeated blocks in maximum packing of triples with index 2

Repeated blocks in maximum packing of triples with index 2

Abstract We determine (leaving a few cases) the spectrum of support sizes for a maximum packing of triples of order v and index 2 (MPT( v ,2)), v ≡2(mod 3). This problem is equivalent to determining the spectrum of repeated blocks in an MPT ( v ,2) for v ≡2(mod 3). This problem for v ≡ 0, 1 (mod 3) has been solved by Rosa and Hoffman (1986).

Salvatore Milici | Gaetano Quattrocchi

[1] Dean G. Hoffman,et al. The number of repeated blocks in twofold triple systems , 1986, J. Comb. Theory, Ser. A.

[2] Charles J. Colbourn,et al. Repeated edges in 2-factorizations , 1990, J. Graph Theory.

[3] Haim Hanani,et al. Balanced incomplete block designs and related designs , 1975, Discret. Math..

[4] Charles J. Colbourn,et al. Support sizes of sixfold triple systems , 1993, Discret. Math..

[5] A. S. Hedayat,et al. On Theory and Applications of BIB Designs with Repeated Blocks. , 1977 .

[6] Charles J. Colbourn,et al. The spectrum of support sizes for threefold triple systems , 1990, Discret. Math..

[7] Alexander Rosa,et al. Steiner triple systems having a prescribed number of triples in common , 1975 .

[8] H. P. Wynn,et al. Convex Sets of Finite Population Plans , 1977 .