Weighted Frankl conjecture for union-closed families

From papers

Let [n]={1,,n}[n]=\{1,\ldots,n\}, and let F2[n]\mathcal{F}\subseteq 2^{[n]} be a non-empty union-closed family, meaning that ABFA\cup B\in\mathcal{F} for all A,BFA,B\in\mathcal{F}. Let x1,x2,,xn1x_1,x_2,\ldots,x_n\geq1 be real numbers. Weighted Frankl conjecture. There exists k[n]k\in[n] such that

SF, kSmS, mkxmSF, kSmSxm.\sum_{S\in\mathcal{F},\ k\in S}\prod_{m\in S,\ m\neq k}x_m\geq\sum_{S\in\mathcal{F},\ k\notin S}\prod_{m\in S}x_m.

This weighted assertion is motivated by blowing up each element into a family of non-empty subsets. The source presents it as a new conjecture derived from Frankl's conjecture, and gives no resolution; in particular, its general validity remains open.

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

Veronica Phan, “Blow-up trick in Combinatorics”, arXiv:2605.06725 (2026).

Solutions 0

No solutions have been posted yet.