The asymptotic Erdős–Ko–Rado conjecture for cross-t-intersecting families

Let C(n,k,l,t)C(n,k,l,t) be the collection of pairs (A,B)(\mathcal A,\mathcal B) of cross-tt-intersecting families with A([n]k)\mathcal A\subseteq\binom{[n]}{k} and B([n]l)\mathcal B\subseteq\binom{[n]}{l}, and define

N(n,k,l,t)=max(A,B)C(n,k,l,t)AB.N(n,k,l,t)=\max_{(\mathcal A,\mathcal B)\in C(n,k,l,t)}|\mathcal A|\,|\mathcal B|.

The cross-tt Erdős–Ko–Rado conjecture. For fixed k,l,tk,l,t, one has

N(n,k,l,t)=(ntkt)(ntlt)N(n,k,l,t)=\binom{n-t}{k-t}\binom{n-t}{l-t}

for all nn0(k,l,t)n\ge n_0(k,l,t). The case t=1t=1 is known by the theorem of Matsumoto and Tokushige; the conjecture asserts the corresponding eventual formula for every tt.

Sources & referencesView supporting material

Primary source

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

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.