On the union of intersecting families
From MaRDI portal
Publication:5222559
Abstract: A family of sets is said to be emph{intersecting} if any two sets in the family have nonempty intersection. In 1973, ErdH{o}s raised the problem of determining the maximum possible size of a union of different intersecting families of -element subsets of an -element set, for each triple of integers . We make progress on this problem, proving that for any fixed integer and for any , if is an -element set, and , where each is an intersecting family of -element subsets of , then , with equality only if for some with . This is best possible up to the size of the term, and improves a 1987 result of Frankl and F"uredi, who obtained the same conclusion under the stronger hypothesis , in the case . Our proof utilises an isoperimetric, influence-based method recently developed by Keller and the authors.
Recommendations
- The maximum size of intersecting and union families of sets
- Multiply intersecting families of sets
- Intersecting families in \(\begin{pmatrix}[m]\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)
- Some results on intersecting families of subsets
- Size and structure of large \((s,t)\)-union intersecting families
Cites work
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 3561378 (Why is no real title available?)
- An approximate zero-one law
- Contributions to the geometry of Hamming spaces
- Correlation inequalities on some partially ordered sets
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Extremal problems concerning Kneser-graphs
- Families of Non-disjoint subsets
- Improved bounds for Erdős' matching conjecture
- On a biased edge isoperimetric inequality for the discrete cube
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- The size of a hypergraph and its matching number
- Thresholds and Expectation Thresholds
Cited in
(29)- Intersecting families with minimum volume
- Enumeration of intersecting families
- Compressions and probably intersecting families
- Intersecting families in a subset of Boolean lattices
- scientific article; zbMATH DE number 5535209 (Why is no real title available?)
- Intersecting families of sets are typically trivial
- Intersecting families in \(\begin{pmatrix}[m]\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)
- Size and structure of large \((s,t)\)-union intersecting families
- Intersecting Families are Essentially Contained in Juntas
- Multiply union families in \(\mathbb{N}^n\)
- scientific article; zbMATH DE number 15490 (Why is no real title available?)
- Sharp bounds for the chromatic number of random Kneser graphs
- On the size of maximal intersecting families
- The structure of large intersecting families
- scientific article; zbMATH DE number 5122069 (Why is no real title available?)
- Brace-Daykin type inequalities for intersecting families
- On the arithmetic mean of the size of cross-union families
- Trivial colors in colorings of Kneser graphs
- Stabilities for non-uniform \(t\)-intersecting families
- Chain intersecting families
- Maximum degree and diversity in intersecting hypergraphs
- Intersecting families in symmetric unions of direct products of set families
- On shadows of intersecting families
- The unbalance of set systems
- The random walk method for intersecting families
- Union-intersecting set systems
- Some exact results for multiply intersecting families
- Diversity of uniform intersecting families
- Non-trivially intersecting multi-part families
This page was built for publication: On the union of intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222559)