Extremal problems among subsets of a set. (Reprint)
From MaRDI portal
Publication:2497992
DOI10.1016/J.DISC.2006.03.013zbMATH Open1105.05069OpenAlexW4206331909WikidataQ105815822 ScholiaQ105815822MaRDI QIDQ2497992FDOQ2497992
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
Recommendations
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Algebraic coding theory
- Intersection theorems for systems of sets
- Intersection Theorems for Systems of Sets
- Title not available (Why is that?)
- Intersection theorems for systems of finite sets
- On Dedekind's Problem: The Number of Monotone Boolean Functions
- Title not available (Why is that?)
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On a lemma of Littlewood and Offord on the distribution of certain sums
- On a combinatorial conjecture of Erdös
- On a combinatorial problem. II
- A short proof of Sperner's lemma
- Families of Non-disjoint subsets
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- Title not available (Why is that?)
- Maximal number of subsets of a finite set No k of which are pairwise disjoint
- Ein kombinatorisches Problem von P. Erdős und A. Hajnal
- A Combinatorial Theorem on Systems of Sets
- On A Combinatorial Problem III
- On subsets contained in a family of non-commensurable subsets of a finite set
- On a conjecture of milner on k-graphs with non-disjoint edges
- Some Remarks on a Combinatorial Theorem of Erdös and Rado
- Title not available (Why is that?)
- On families of subsets of a finite set containing no two disjoint sets and their union
- Title not available (Why is that?)
Cited In (7)
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)