New inequalities for families without k pairwise disjoint members

DOI10.1016/J.JCTA.2018.01.007MaRDI QIDQ1747778zbMATH OpenOpenAlexWikidataFDO

Authors 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

cross-dependent familiesextremal set theoryfamilies with no matchingsKleitman's problem

Mathematics Subject Classification ID

Extremal set theory (05D05)

Abstract: Some best possible inequalities are established for k-partition-free families (cf. Definition 1) and they are applied to prove a sharpening of a classical result of Kleitman concerning families without k pairwise disjoint members.

Recommendations

• On families of sets without \(k\) pairwise disjoint members
• Partition-free families of sets
• Families with no s pairwise disjoint sets
• scientific article; zbMATH DE number 4023284
• Extremal problems concerning Kneser-graphs

Cites work

• A simple proof of the Erdős-Chao Ko-Rado theorem
• scientific article; zbMATH DE number 1420987 (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

(12)

• Families of sets with no matchings of sizes 3 and 4
• On families of sets without \(k\) pairwise disjoint members
• Old and new applications of Katona's circle
• The Erdős matching conjecture and concentration inequalities
• A generalization of Kneser graphs
• 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\)
• scientific article; zbMATH DE number 4164883 (Why is no real title available?)
• Anti-Ramsey numbers of paths and cycles in hypergraphs
• Partition-free families of sets
• Some results around the Erdős matching conjecture
• A note on vertex Turán problems in the Kneser cube

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747778)