rr‐Cross tt‐intersecting families via necessary intersection points
From MaRDI portal
Publication:6096797
Abstract: Given integers and we call families -cross -intersecting if for all , , we have . We obtain a strong generalisation of the classic Hilton-Milner theorem on cross intersecting families. In particular, we determine the maximum of for -cross -intersecting families in the cases when these are -uniform families or arbitrary subfamilies of . 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 -cross -intersecting families. This also provides the maximum of for families of possibly mixed uniformities .
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
Cites work
- scientific article; zbMATH DE number 5122069 (Why is no real title available?)
- scientific article; zbMATH DE number 4010447 (Why is no real title available?)
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- scientific article; zbMATH DE number 863493 (Why is no real title available?)
- scientific article; zbMATH DE number 1420979 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- A cross-intersection theorem for vector spaces based on semidefinite programming
- A cross‐intersection theorem for subsets of a set
- A new generalization of the Erdős-Ko-Rado theorem
- A pushing-pulling method: New proofs of intersection theorems
- A size-sensitive inequality for cross-intersecting families
- An Intersection Theorem for a Collection of Families of Subsets of a Finite Set
- Analogues of Katona's and Milner's theorems for two families
- Beyond the Erdős-Ko-Rado theorem
- Contributions to the geometry of Hamming spaces
- Cross-intersecting families and primitivity of symmetric systems
- Extremal problems for finite sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- More complete intersection theorems
- Nontrivial independent sets of bipartite graphs and cross-intersecting families
- On \(r\)-cross intersecting families of sets
- On the hardness of approximating minimum vertex cover
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Some best possible inequalities concerning cross-intersecting families
- The complete intersection theorem for systems of finite sets
- The diametric theorem in Hamming spaces---optimal anticodes
- The exact bound in the Erdős-Ko-Rado theorem
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- The maximum product of sizes of cross-intersecting families
- The maximum product of weights of cross-intersecting families
- The maximum sum and the maximum product of sizes of cross-intersecting families
- The maximum sum of sizes of cross-intersecting families of subsets of a set
- The weighted complete intersection theorem
- Uniform s-Cross-Intersecting Families
Cited in
(2)
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)