Frankl’s Intersection–Union Product Conjecture
Let be the maximum cardinality of a family such that, for every distinct , and . For all integers with and , the conjecture asserts that . Equality is attained by the product family , where are disjoint with and .
References
- Proving the optimality of the product construction for the intersection--union problem — arXiv — Fan Chang, Peter Frankl, Jian Wang
Source: arXiv
Progress summary
A new unrefereed preprint proves the conjecture for many large parameter values, but the full finite-parameter problem remains open.
Frankl’s conjecture asserts that the natural product construction is optimal for the intersection–union problem. The reported result settles a broad range but not every finite choice of parameters.
October 2026 preprint
Fan Chang, Peter Frankl, and Jian Wang claim optimality when and exceeds an explicit threshold, complementing earlier results for or . This is an unrefereed preprint and does not cover all finite parameter values.
Current status (as of October 2026): The conjecture is claimed in the reported large- ranges, while the remaining finite parameter cases are open and the new result is unverified.
Sources
Solutions 0
No solutions have been posted yet.