← All problems

Frankl–Ota–Tokushige conjecture on intersecting k-graphs

Let m(k)m(k) be the maximum of ∣H∣|\mathcal{H}| over all intersecting kk-uniform hypergraphs H\mathcal{H} with covering number τ(H)=k\tau(\mathcal{H})=k. The Frankl–Ota–Tokushige conjecture states that there exists an absolute constant c>0c>0 such that, for every positive integer kk, m(k)≤(ck)km(k)\le (ck)^k.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

A new preprint sharply improves the known lower bound, but the conjectured fixed-constant upper bound remains open.

The Frankl–Ota–Tokushige conjecture predicts an upper bound of the form (ck)k(ck)^k for the relevant extremal quantity m(k)m(k). That upper bound has not been proved.

October 2026 lower-bound advance

Peter Frankl, Jian Wang, Yaoran Zhang, and Yutong Zhang claim that, for sufficiently large kk, m(k)≥kkexp⁡(−50klog⁡k)m(k)\ge k^k\exp(-50\sqrt{k\log k}). Combined with the cited upper bound, this narrows the scale to m(k)=kkexp⁡(−k1/2+o(1))m(k)=k^k\exp(-k^{1/2+o(1)}), but the fixed-constant upper bound (ck)k(ck)^k remains unresolved.

Current status (as of October 2026): the lower-bound scale has been claimed at kkexp⁡(−k1/2+o(1))k^k\exp(-k^{1/2+o(1)}), while the conjectured (ck)k(ck)^k upper bound remains open.

Sources

Solutions 0

No solutions have been posted yet.