Extremal problems among subsets of a set. (Reprint)

DOI10.1016/J.DISC.2006.03.013MaRDI QIDQ2497992zbMATH OpenOpenAlexWikidataFDO

Authors Daniel J. Kleitman, P. Erdős

Publication date 4 August 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.03.013

zbMATH Keywords

extremal set problemsintersection theorems

Mathematics Subject Classification ID

Extremal set theory (05D05)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 3342001
• scientific article; zbMATH DE number 4173033
• Extremal problems among subsets of a set
• Invitation to intersection problems for finite sets
• Problems and results in extremal combinatorics. I.

Cites work

• A Combinatorial Theorem on Systems of Sets
• A short proof of Sperner's lemma
• Algebraic coding theory
• Ein kombinatorisches Problem von P. Erdős und A. Hajnal
• Families of Non-disjoint subsets
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• scientific article; zbMATH DE number 3489128 (Why is no real title available?)
• scientific article; zbMATH DE number 3230288 (Why is no real title available?)
• scientific article; zbMATH DE number 3333307 (Why is no real title available?)
• scientific article; zbMATH DE number 3415852 (Why is no real title available?)
• scientific article; zbMATH DE number 3189757 (Why is no real title available?)
• Intersection theorems for systems of finite sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• Intersection theorems for systems of sets
• Maximal number of subsets of a finite set No k of which are pairwise disjoint
• On a combinatorial conjecture of Erdös
• On A Combinatorial Problem III
• On a combinatorial problem. II
• On a conjecture of milner on k-graphs with non-disjoint edges
• On a lemma of Littlewood and Offord on the distribution of certain sums
• On Dedekind's Problem: The Number of Monotone Boolean Functions
• On families of subsets of a finite set containing no two disjoint sets and their union
• On subsets contained in a family of non-commensurable subsets of a finite set
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Some Remarks on a Combinatorial Theorem of Erdös and Rado

Cited in

(10)

• Extremal problems among subsets of a set
• An old sub-quadratic algorithm for finding extremal sets
• scientific article; zbMATH DE number 3880761 (Why is no real title available?)
• scientific article; zbMATH DE number 3903454 (Why is no real title available?)
• scientific article; zbMATH DE number 4039941 (Why is no real title available?)
• scientific article; zbMATH DE number 863493 (Why is no real title available?)
• Complexity of extremal set decision problem
• On an extremal problem of set system
• scientific article; zbMATH DE number 3342001 (Why is no real title available?)
• Invitation to intersection problems for finite sets

This page was built for publication: Extremal problems among subsets of a set. (Reprint)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497992)