Maximal number of subsets of a finite set No k of which are pairwise disjoint
From MaRDI portal
Publication:5656776
Cited in
(26)- On non-trivial families without a perfect matching
- Families with no matchings of size s
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- Proof of the Erdős matching conjecture in a new range
- The Erdős matching conjecture and concentration inequalities
- Erdős matching conjecture for almost perfect matchings
- Families of sets with no matchings of sizes 3 and 4
- Extremal set theory for the binomial norm
- Refuting conjectures in extremal combinatorics via linear programming
- New inequalities for families without \(k\) pairwise disjoint members
- Old and new applications of Katona's circle
- Families of finite sets satisfying intersection restrictions
- On families with bounded matching number
- On the arithmetic mean of the size of cross-union families
- Some results around the Erdős matching conjecture
- Erdös–Ko–Rado Theorem—22 Years Later
- Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs
- Turán, involution and shifting
- Families with no perfect matchings
- Extremal problems among subsets of a set. (Reprint)
- On families of sets without \(k\) pairwise disjoint members
- Invitation to intersection problems for finite sets
- On the size of the product of overlapping families
- On the maximum number of edges in a hypergraph with given matching number
- A relationship for LYM inequalities between Boolean lattices and linear lattices with applications
- Rainbow version of the Erdős Matching Conjecture via concentration
This page was built for publication: Maximal number of subsets of a finite set No k of which are pairwise disjoint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5656776)
