rr‐Cross tt‐intersecting families via necessary intersection points

DOI10.1112/BLMS.12803arXiv2010.11928OpenAlexW4321369793WikidataQ122655665 ScholiaQ122655665MaRDI QIDQ6096797FDOQ6096797

Authors: Pranshu Gupta, Yannick Mogge, Simón Piga, Bjarne Schülke 

Publication date: 15 September 2023

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

Abstract: Given integers $rgeq2$ and $n,tgeq1$ we call families $mathcal{F}_1,dots,mathcal{F}_{r}subseteqmathscrP([n])$ $r$-cross $t$-intersecting if for all $F_{i}inmathcal{F}_i$, $iin[r]$, we have $$. We obtain a strong generalisation of the classic Hilton-Milner theorem on cross intersecting families. In particular, we determine the maximum of $su{m}_{jin[r]}vertmathcal{F}_{j}vert$ for $r$-cross $t$-intersecting families in the cases when these are $k$-uniform families or arbitrary subfamilies of $mathscrP([n])$. Only some special cases of these results had been proved before. We obtain the aforementioned theorems as instances of a more general result that considers measures of $r$-cross $t$-intersecting families. This also provides the maximum of $su{m}_{jin[r]}vertmathcal{F}_{j}vert$ for families of possibly mixed uniformities $k_1,ldots,k_r$.

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

Recommendations

• The maximum product of sizes of cross-intersecting families
• The maximum sum and product of sizes of cross-intersecting families
• The maximum sum and the maximum product of sizes of cross-intersecting families
• On non-empty cross-\(t\)-intersecting families
• Nearly extremal non-trivial cross \(t\)-intersecting families and \(r\)-wise \(t\)-intersecting families

zbMATH Keywords

cross-intersecting families

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05)

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Contributions to the geometry of Hamming spaces
• The complete intersection theorem for systems of finite sets
• On the hardness of approximating minimum vertex cover
• The diametric theorem in Hamming spaces---optimal anticodes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cross-intersecting families and primitivity of symmetric systems
• The exact bound in the Erdős-Ko-Rado theorem
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Nontrivial independent sets of bipartite graphs and cross-intersecting families
• Some best possible inequalities concerning cross-intersecting families
• On \(r\)-cross intersecting families of sets
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• Title not available (Why is that?)
• The maximum sum and the maximum product of sizes of cross-intersecting families
• A new generalization of the Erdős-Ko-Rado theorem
• Beyond the Erdős-Ko-Rado theorem
• Title not available (Why is that?)
• A cross-intersection theorem for vector spaces based on semidefinite programming
• An Intersection Theorem for a Collection of Families of Subsets of a Finite Set
• A cross‐intersection theorem for subsets of a set
• The maximum product of weights of cross-intersecting families
• More complete intersection theorems
• The weighted complete intersection theorem
• A size-sensitive inequality for cross-intersecting families
• A pushing-pulling method: New proofs of intersection theorems
• The maximum sum of sizes of cross-intersecting families of subsets of a set
• The maximum product of sizes of cross-intersecting families
• Title not available (Why is that?)
• Extremal problems for finite sets
• Uniform s-Cross-Intersecting Families
• Analogues of Katona's and Milner's theorems for two families

Cited In (2)

• The maximum sum of sizes of non-empty cross \(t\)-intersecting families
• Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families

This page was built for publication: r$r$‐Cross t$t$‐intersecting families via necessary intersection points

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