Maximal number of subsets of a finite set No k of which are pairwise disjoint

DOI10.1016/S0021-9800(68)80050-XzbMath0245.05003MaRDI QIDQ5656776

Daniel J. Kleitman

Publication date: 1968

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (23)

Rainbow version of the Erdős Matching Conjecture via concentration ⋮ Families of sets with no matchings of sizes 3 and 4 ⋮ Families with no perfect matchings ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Proof of the Erdős matching conjecture in a new range ⋮ On families with bounded matching number ⋮ Turán, involution and shifting ⋮ Families with no matchings of size \(s\) ⋮ Erdős matching conjecture for almost perfect matchings ⋮ On families of sets without \(k\) pairwise disjoint members ⋮ New inequalities for families without \(k\) pairwise disjoint members ⋮ On the maximum number of edges in a hypergraph with given matching number ⋮ Refuting conjectures in extremal combinatorics via linear programming ⋮ Extremal set theory for the binomial norm ⋮ On non-trivial families without a perfect matching ⋮ Erdös–Ko–Rado Theorem—22 Years Later ⋮ Extremal problems among subsets of a set. (Reprint) ⋮ Old and new applications of Katona's circle ⋮ Invitation to intersection problems for finite sets ⋮ On the arithmetic mean of the size of cross-union families ⋮ Families of finite sets satisfying intersection restrictions ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman ⋮ On the size of the product of overlapping families

This page was built for publication: Maximal number of subsets of a finite set No k of which are pairwise disjoint