Extremal problems among subsets of a set (Q1843567): Difference between revisions

This paper is a review of results and progress in the study of extremal problems on collection of subsets of a finite set, as of the spring of 1970, as presented at the 1970 Chapel Hill Conference. A typical problem might be given a collection of subsets of an \(n\) element set such that no two members have exactly \(k\) or fewer elements in common, how large can the collection be? Much has been accomplished in this area since 1970. A more recent review is contained in the article by \textit{G.O.H.Katona} in Combinatorics, Part 2 , Proc. Adv. Stud. Inst., Breukelen, 13-42 (1974; Zbl 0298.05142) on Extremal problems for hypergraphs; a paper by \textit{C. Greene} and \textit{D.J.Kleitman} in MAA Studies in Mathematics 17, Stud. in Combinatorics 22-79 (1978; Zbl 0409.05012) reviews some of the methods that have been developed for such problems.