Let \(L\) be a set of \(s\) non-negative integers, and \({\mathcal A, B} \subset 2^{[n]}.\) Then the pair \(({\mathcal A, B})\) is \(L\)-cross-intersecting if for all \(A \in {\mathcal A}\) and \(B \in {\mathcal B}\) we have \(| A\cap B| \in L.\) This paper determines the maximum possible \(P_L(n)= | {\mathcal A}| | {\mathcal B}| \) for sufficiently large \(n,\) improving earlier work of Sgall.
Recommendations
Cites work
- A general 4-words inequality with consequences for 2-way communication complexity
- An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary codes
- Approximating the independence number via the -function
- Bounds on pairs of families with restricted intersections
- Families of Non-disjoint subsets
- Forbidden Intersections
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 1775389 (Why is no real title available?)
- Intersection theorems with geometric consequences
- Large sets of nearly orthogonal vectors
- On t-designs
- Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
Cited in
(6)- On two set-systems with restricted cross-intersections
- Disjoint pairs in set systems with restricted intersection
- Almost cross-intersecting and almost cross-Sperner pairs of families of sets
- An intersection problem with 6 extremes
- Cross L-intersecting families on set systems
- Uniformly cross intersecting families
This page was built for publication: On a restricted cross-intersection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855846)
