On families of sets without \(k\) pairwise disjoint members

DOI10.1016/j.jctb.2017.10.002zbMath1384.05150OpenAlexW2765125610MaRDI QIDQ1745733

Peter Frankl

Publication date: 18 April 2018

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2017.10.002

zbMATH Keywords

partitionsfinite setsoptimal familiespairwise disjoint

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Extremal set theory (05D05)

Related Items (2)

On families with bounded matching number ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs

Cites Work

• Unnamed Item
• Families with no matchings of size \(s\)
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Families with no s pairwise disjoint sets
• Maximal number of subsets of a finite set No k of which are pairwise disjoint

This page was built for publication: On families of sets without \(k\) pairwise disjoint members