The Sperner-system strengthening of Snevily's conjecture

From papers

Let n,sn,s be integers with n2s1n\geq 2s-1, let L={1,2,,s}L=\{\ell_{1},\ell_{2},\ldots,\ell_{s}\} be a set of ss non-negative integers, and let an LL-intersecting Sperner system be a Sperner family F2[n]\mathcal{F}\subseteq 2^{[n]} such that FFL|F\cap F'|\in L for every distinct F,FFF,F'\in\mathcal{F}. The Sperner-system strengthening. Every such family satisfies

F(ns).|\mathcal{F}|\leq\binom{n}{s}.

The source presents this as a stronger conjecture than Snevily's conjecture. The bound is immediate from the LYM inequality when n<2s1n<2s-1, while the stated range is not settled in the supplied text.

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

Jun Gao, Hong Liu and Zixiang Xu, “Stability through non-shadows”, arXiv:2212.07821 (2023).

Solutions 0

No solutions have been posted yet.