The Ahlswede–Khachatrian conjecture for cross-t-intersecting families

From papers

Let C(n,k,l,t)C(n,k,l,t) and N(n,k,l,t)N(n,k,l,t) be as above. For integers i,ji,j with 0i+jnt0\le i+j\le n-t, define

Gij(n,k,t)={F([n]k):F[t+i+j]t+i}.\mathcal G_{ij}(n,k,t)=\left\{F\in\binom{[n]}{k}:|F\cap[t+i+j]|\ge t+i\right\}.

The cross-intersecting Ahlswede–Khachatrian conjecture. One has

N(n,k,l,t)=max0i+jntGij(n,k,t)Gji(n,l,t).N(n,k,l,t)=\max_{0\le i+j\le n-t}|\mathcal G_{ij}(n,k,t)|\,|\mathcal G_{ji}(n,l,t)|.

Moreover, up to a permutation of [n][n], an optimal cross-tt-intersecting pair is (Gij(n,k,t),Gji(n,l,t))(\mathcal G_{ij}(n,k,t),\mathcal G_{ji}(n,l,t)) for some i,ji,j. This generalizes the Ahlswede–Khachatrian theorem for ordinary tt-intersecting families; the corresponding cross-family classification is presented as open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

James Hirschorn, “Asymptotic upper bounds on the shades of t-intersecting families”, arXiv:0808.1434 (2008).

Solutions 0

No solutions have been posted yet.