Abstract :
Let H denote the set {f1, f2,…, fn}, 2[n] the collection of all subsets of H and F⊆2[n] be a family. The maximum of |F| is studied if any k subsets have a non-empty intersection and the intersection of any l distinct subsets (1⩽k
Keywords :
Finite projective geometries , Extremal problems for families of finite sets
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics