Extremal problems among subsets of a set. (Reprint)

DOI10.1016/j.disc.2006.03.013zbMath1105.05069OpenAlexW4206331909WikidataQ105815822 ScholiaQ105815822MaRDI QIDQ2497992

Daniel J. Kleitman, Paul 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

intersection theoremsextremal set problems

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

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