论文信息 - The minimum independence number for designs

The minimum independence number for designs

Fort=2,3 andk≥2t−1 we prove the existence oft−(n,k,λ) designs with independence numberCλ,kn(k−t)/(k−1)(ln n)1/(k−1). This is, up to the constant factor, the best possible.Some other related results are considered.

[1] Vojtech Rödl,et al. A Canonical Ramsey Theorem , 1992, Random Struct. Algorithms.

[2] J. Hirschfeld. Projective Geometries Over Finite Fields , 1980 .

[3] Hanfried Lenz,et al. Design theory , 1985 .

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

[5] Zoltán Füredi. Maximal Independent Subsets in Steiner Systems and in Planar Sets , 1991, SIAM J. Discret. Math..

[6] Vojtech Rödl,et al. The number of submatrices of a given type in a Hadamard matrix and related results , 1988, J. Comb. Theory, Ser. B.

[7] Vojtech Rödl,et al. A ramsey type problem concerning vertex colourings , 1991, J. Comb. Theory, Ser. B.