← All problems

Xu–Yip–Zhang conjecture on uniform witness families

Less than 1 year old · traced to

Let [n]={1,…,n}[n]=\{1,\ldots,n\}, let 0⩽s⩽d0\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 F∈FF\in\mathcal{F} there exists a set BF⊆FB_F\subseteq F with ∣BF∣=s|B_F|=s and

F∩F′≠BFF\cap F'\neq B_F

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

∣F∣⩽(n−1d).|\mathcal{F}|\leqslant\binom{n-1}{d}.
References

Status

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

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.