The Sperner-system strengthening of Snevily's conjecture

About 4 years old · traced to

Let n,sn,s be integers with n≥2s−1n\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 F⊆2[n]\mathcal{F}\subseteq 2^{[n]} such that ∣F∩F′∣∈L|F\cap F'|\in L for every distinct F,F′∈FF,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<2s−1n<2s-1, while the stated range is not settled in the supplied text.

References

Primary source

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

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.