论文信息 - More on halving the complete designs

More on halving the complete designs

Abstract A large set of disjoint S (λ; t , k , v ) designs, denoted by LS (λ; t , k , v ), is a partition of k -subsets of v -set into S (λ; t , k , v ) designs. In this paper, we develop some recursive methods to construct large sets ot t -designs. As a consequence, we show that a conjecture of Hartman on halving complete designs is true for t = 2 and 3 ⩽ k ⩽ 15.

Gholamreza B. Khosrovshahi | S. Ajoodani-Namini

[1] Jia-Xi Lu,et al. On Large Sets of Disjoint Steiner Triple Systems III , 1983, J. Comb. Theory, Ser. A.

[2] Michel Dehon. On the existence of 2-designs Slambda(2, 3, upsilon) without repeated blocks , 1983, Discret. Math..

[3] Gholamreza B. Khosrovshahi,et al. A New Basis for Trades , 1990, SIAM J. Discret. Math..

[4] Gholamreza B. Khosrovshahi,et al. Combining t-designs , 1991, J. Comb. Theory, Ser. A.

[5] Daniel J. Kleitman,et al. A new basis for trades , 1990 .

[6] Luc Teirlinck,et al. Locally trivial t-designs and t-designs without repeated blocks , 1989, Discret. Math..

[7] Jia-Xi Lu,et al. On Large Sets of Disjoint Steiner Triple Systems II , 1983, J. Comb. Theory, Ser. A.

[8] Alan Hartman,et al. Halving the Complete Design , 1987 .

[9] William O. Alltop. Extending t-Designs , 1975, J. Comb. Theory, Ser. A.

[10] Leo G. Chouinard,et al. Partitions of the 4-subsets of a 13-set into disjoint projective planes , 1983, Discret. Math..

[11] Jean Van Buggenhaut,et al. On the existence of 2-designs S2(2, 3, v) without repeated blocks , 1974, Discret. Math..

[12] Lu Jia-xi,et al. On Large Sets of Disjoint Steiner Triple Systems, IV , 1983, J. Comb. Theory, Ser. A.

[13] Spyros S. Magliveras,et al. Construction Procedures for t-designs and the Existence of New Simple 6–designs , 1985 .