Erdős, Paul; Kleitman, Daniel J. Extremal problems among subsets of a set. (Reprint). (English) Zbl 1105.05069 Discrete Math. 306, No. 10-11, 923-931 (2006). This paper is a reprint of a classical article published in [Discrete Math. 8, 281–294 (1974; Zbl 0281.04002)]. It is a survey on extremal set problems. Although all references in this paper go back to 60th and meanwhile a huge number of newer papers have been published on this subject, some mentioned problems are still unsolved and deserve a reminder. A typical example of a problem in the survey is how large can a family of subsets be that satisfy some conditions on the union or intersection, etc. The authors emphasize on families with intersection/rank/containment/union limitations. Reviewer: Sergej L. Bezrukov (Superior) MSC: 05D05 Extremal set theory Keywords:extremal set problems; intersection theorems Citations:Zbl 0281.04002 PDF BibTeX XML Cite \textit{P. Erdős} and \textit{D. J. Kleitman}, Discrete Math. 306, No. 10--11, 923--931 (2006; Zbl 1105.05069) Full Text: DOI References: This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.