Partition-free families of sets

DOI10.1112/PLMS.12236MaRDI QIDQ5237375zbMATH OpenOpenAlexWikidataFDO

Authors Peter Frankl, Andrey B. Kupavskii

Publication date 17 October 2019

Published in Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1706.00215, http://real.mtak.hu/90051/1/Partition-free_families_of_sets.pdf

zbMATH Keywords

Kleitman's conjecture

Mathematics Subject Classification ID

Extremal set theory (05D05) Transversal (matching) theory (05D15)

Abstract: Let $m(n)$ denote the maximum size of a family of subsets which does not contain two disjoint sets along with their union. In 1968 Kleitman proved that $m(n)=nchoosem+1+ldots+nchoose2m+1$ if $n=3m+1$. Confirming the conjecture of Kleitman, we establish the same equality for the cases $n=3m$ and $n=3m+2$, and also determine all extremal families. Unlike the case $n=3m+1$, the extremal families are not unique. This is a plausible reason behind the relative difficulty of our proofs. We completely settle the case of several families as well.

Recommendations

• On families of sets without \(k\) pairwise disjoint members
• Families with no s pairwise disjoint sets
• New inequalities for families without \(k\) pairwise disjoint members
• Partition-free families of sets
• Families of sets with no matchings of sizes 3 and 4

Cited in

(24)

• Note on generating all subsets of a finite set with disjoint unions
• On families of sets without \(k\) pairwise disjoint members
• New inequalities for families without \(k\) pairwise disjoint members
• Partition-free families of sets
• Absolute equal distribution of families of finite sets.
• On \(abab\)-free and \(abba\)-free set partitions
• The partition method for poset-free families
• Lower bounds on the clique-chromatic numbers of some distance graphs
• On a Frankl-Wilson theorem
• New bounds on clique-chromatic numbers of Johnson graphs
• Non-trivial \(d\)-wise intersecting families
• On stability of the independence number of a certain distance graph
• Modularity of some distance graphs
• New bounds for the clique-chromatic numbers of Johnson graphs
• On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• Convolution estimates and number of disjoint partitions
• Set Partitions with No m-Nesting
• Partitions with certain intersection properties
• scientific article; zbMATH DE number 1802825 (Why is no real title available?)
• scientific article; zbMATH DE number 15490 (Why is no real title available?)
• Families with no s pairwise disjoint sets
• Extremal Uniquely Resolvable Multisets
• Some results around the Erdős matching conjecture

This page was built for publication: Partition-free families of sets

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