Frankl and Wang's sturdiness conjecture for IU-families

From papers

Let [n]={1,,n}[n]=\{1,\ldots,n\}, let 2[n]2^{[n]} denote the power set of [n][n], and let an IU-family be a family G2[n]\mathcal{G}\subseteq 2^{[n]} such that

FFfor all F,FG,F\cap F'\neq\emptyset\quad\text{for all }F,F'\in\mathcal{G},

and

FF[n]for all F,FG.F\cup F'\neq[n]\quad\text{for all }F,F'\in\mathcal{G}.

Write β(G)\beta(\mathcal{G}) for the sturdiness of G\mathcal{G}. Frankl and Wang's conjecture. If G2[n]\mathcal{G}\subseteq 2^{[n]} is an IU-family, then

β(G)2n4.\beta(\mathcal{G})\leq 2^{n-4}.

The conjecture proposes a sharp upper bound on the local robustness, or sturdiness, of IU-families; the preceding IU-Theorem gives the corresponding maximum-size bound G2n2|\mathcal{G}|\leq 2^{n-2}. Its resolution is not indicated 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

Yongjiang Wu, Zhiyi Liu, Lihua Feng and Yongtao Li, “Two results on set families: sturdiness and intersection”, arXiv:2508.19723 (2026).

Solutions 0

No solutions have been posted yet.