New inequalities for families without \(k\) pairwise disjoint members

DOI10.1016/j.jcta.2018.01.007zbMath1385.05069arXiv1804.03581OpenAlexW2789573345WikidataQ130119979 ScholiaQ130119979MaRDI QIDQ1747778

Peter Frankl, Andrey B. Kupavskii

Publication date: 27 April 2018

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

Full work available at URL: https://arxiv.org/abs/1804.03581

zbMATH Keywords

extremal set theorycross-dependent familiesfamilies with no matchingsKleitman's problem

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (7)

Families of sets with no matchings of sizes 3 and 4 ⋮ The Erdős matching conjecture and concentration inequalities ⋮ A generalization of Kneser graphs ⋮ Old and new applications of Katona's circle ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman ⋮ On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)

Cites Work

• Unnamed Item
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• A simple proof of the Erdős-Chao Ko-Rado theorem
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Maximal number of subsets of a finite set No k of which are pairwise disjoint

This page was built for publication: New inequalities for families without \(k\) pairwise disjoint members