On a restricted cross-intersection problem (Q855846): Difference between revisions

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.