论文信息 - On the Covering of Pairs by Quadruples II

On the Covering of Pairs by Quadruples II

Abstract Let S be a finite set of order n. Let C(n, 4, 2) be the minimum number of quadruples such that each pair of elements of S is contained in at least one of them. In this paper C(n, 4, 2) is determined for all n divisible by 3. The case in which n is not divisible by 3 will be treated in a second paper.

W. H. Mills | W. Mills

[1] Marion Fort,et al. Minimal coverings of pairs by triples , 1958 .

[2] R. C. Bose. ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS , 1939 .

[3] W. H. Mills. Three Mutually Orthogonal Latin Squares , 1972, J. Comb. Theory, Ser. A.

[4] R. G. Stanton,et al. Maximal and minimal coverings of (k − 1)-tuples by k-tuples , 1968 .

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

[6] D. K. Ray-Chaudhuri,et al. Solution of Kirkman''s schoolgirl problem , 1971 .

[7] Haim Hanani,et al. On Quadruple Systems , 1960, Canadian Journal of Mathematics.

[8] R. C. Bose,et al. Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture , 1960, Canadian Journal of Mathematics.

[9] H. Hanani. A Balanced Incomplete Block Design , 1965 .