Xu–Yip–Zhang conjecture on uniform witness families

From papers

Let [n]={1,,n}[n]=\{1,\ldots,n\}, let 0sd0\leqslant s\leqslant d, and let F([n]d+1)\mathcal{F}\subseteq\binom{[n]}{d+1}. An ss-witness family is a family such that for every FFF\in\mathcal{F} there exists a set BFFB_F\subseteq F with BF=s|B_F|=s and

FFBFF\cap F'\neq B_F

for every FFF'\in\mathcal{F}. Xu–Yip–Zhang conjecture. If n2(d+1)n\geqslant 2(d+1) and F\mathcal{F} is an ss-witness family, then

F(n1d).|\mathcal{F}|\leqslant\binom{n-1}{d}.

The case s=0s=0 is the Erdős–Ko–Rado theorem, and the cases s{1,d}s\in\{1,d\} were proved in the cited work. The source proves the conjecture for sd/2s\leqslant d/2, while constructing non-star families of the conjectured extremal size for d/2<sd1d/2<s\leqslant d-1; the full statement remains unresolved there.

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

Ting-Wei Chao, Zixuan Xu and Dmitrii Zakharov, “Uniform Set Systems with Uniform Witnesses”, arXiv:2602.17459 (2026).

Solutions 0

No solutions have been posted yet.