An extension of the Erdős–Ko–Rado Theorem

https://doi.org/10.1016/j.endm.2007.01.017Get rights and content

Abstract

A family G2[n] is called r-wise t-intersecting if |G1Gr|t holds for all G1,,GrG. We report some results concerning the maximum size of r-wise t-intersecting families with additional conditions. For example, any k-uniform r-wise t-intersecting family on 2k vertices has size at most (2k1k1) for r7, 1t2rr1 and k>k0(r).

References (31)

  • C. Bey et al.

    Old and new results for the weighted t-intersection problem via AK-methods

  • P. Erdős et al.

    Intersection theorems for systems of finite sets

    Quart. J. Math. Oxford (2)

    (1961)
  • I. Dinur et al.

    On the Hardness of Approximating Minimum Vertex-Cover

    Annals of Mathematics

    (2005)
  • P. Frankl. The Erdős–Ko–Rado theorem is true for n=ckt. Combinatorics (Proc. Fifth Hungarian Colloq., Keszthey, 1976),...
  • P. Frankl

    On intersecting families of finite sets

    J. Combin. Theory (A)

    (1978)
  • Cited by (0)

    1

    The author was supported by MEXT Grant-in-Aid for Scientific Research (B) 16340027.

    View full text