← All problems

Füredi’s conjecture

For every nonnegative integer tt, every integer m≥2m\ge 2, and every family of pairs of finite sets (Ai,Bi)i=1m(A_i,B_i)_{i=1}^m satisfying ∣Ai∩Bi∣≤t|A_i\cap B_i|\le t for all ii and ∣Ai∩Bj∣>t|A_i\cap B_j|>t for all i≠ji\ne j, one has ∑i=1m(∣Ai∣+∣Bi∣−2t∣Ai∣−t)−1≤1\displaystyle\sum_{i=1}^m\binom{|A_i|+|B_i|-2t}{|A_i|-t}^{-1}\le 1.

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

An unrefereed September 2026 preprint claims to prove Füredi’s conjecture, but independent verification has not yet been reported.

Füredi’s conjecture is a central extension of the Bollobás set-pairs inequality for strong Bollobás systems.

Known results

A 2024 preprint proved the conjecture when all pairs satisfy ∣Ai∣+∣Bi∣=N|A_i|+|B_i|=N, and established further monotone-dimension and monotone-size special cases.

September 2026 claimed proof

Zihao Huang and Suijie Wang report a proof using a weighted subspace inequality and an exterior-ideal argument. If correct, this settles the full conjecture; the preprint is unrefereed.

Current status (as of September 2026): A full proof has been claimed by Huang and Wang, while the conjecture remains unverified pending refereeing or independent confirmation.

Sources

Solutions 0

No solutions have been posted yet.