On families of sets without k pairwise disjoint members
From MaRDI portal
Recommendations
Cites work
- Families with no matchings of size s
- Families with no s pairwise disjoint sets
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Maximal number of subsets of a finite set No k of which are pairwise disjoint
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
Cited in
(15)- The maximum number of disjoint pairs in a family of subsets
- Explicit construction of exponential sized families of k-independent sets
- Families of sets with no matchings of sizes 3 and 4
- New inequalities for families without \(k\) pairwise disjoint members
- Constructing union-free pairs of \(k\)-element subsets
- On families of mutually exclusive sets
- scientific article; zbMATH DE number 4164883 (Why is no real title available?)
- scientific article; zbMATH DE number 15490 (Why is no real title available?)
- scientific article; zbMATH DE number 1763916 (Why is no real title available?)
- Anti-Ramsey numbers of paths and cycles in hypergraphs
- Partition-free families of sets
- Families with no s pairwise disjoint sets
- A stability result for families with fixed diameter
- On families with bounded matching number
- Extremal families containing no two sets and their union
This page was built for publication: On families of sets without \(k\) pairwise disjoint members
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1745733)