Extremal problems among subsets of a set

DOI10.1016/0012-365X(74)90140-XzbMath0281.04002OpenAlexW2131114615MaRDI QIDQ1843567

Paul Erdős, Daniel J. Kleitman

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(74)90140-x

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Other combinatorial set theory (03E05)

Related Items

A note on saturation for $k$-wise intersecting families, Kleitman's conjecture about families of given size minimizing the number of \(k\)-chains, Saturating Sperner families, On counting Sperner families, On maximal intersecting families of finite sets, Sperner families over a subset, The number of additive triples in subsets of abelian groups, Sperner's Theorem and a Problem of Erdős, Katona and Kleitman, On the combinatorial problems which I would most like to see solved, On the number of monotone sequences, Extension of some theorems on the density of series of elements of \(N\) to series of finite subsets of \(N\)., Erdös–Ko–Rado Theorem—22 Years Later, Matrices dont deux lignes quelconque coincident dans un nombre donne de positions communes, Taxonomic classes of sets, Invitation to intersection problems for finite sets, An extremal problem among subsets of a set, Maximal intersecting families and affine regular polygons in \(PG(2,q)\), Maximal k-Intersecting Families of Subsets and Boolean Functions, Matchings and covers in hypergraphs

Cites Work

• Unnamed Item
• 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
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set