← All problems

Chen–He–Xie Berge-K4 saturation conjecture

For every integer n≥7n\ge 7, the saturation number of the complete graph K4K_4 in three-uniform Berge hypergraphs satisfies sat⁡3(n,Berge-K4)=n\operatorname{sat}_3(n,\mathrm{Berge}\text{-}K_4)=n. Equivalently, every three-uniform Berge-K4K_4-saturated hypergraph on nn vertices has at least nn hyperedges, and constructions with exactly nn hyperedges exist.

References

Progress summary

Refreshed
Open · progress reported

A 2026 preprint makes substantial partial progress but leaves the middle range of orders unresolved.

Chen, He, and Xie conjecture that the three-uniform Berge-K4K_4 saturation number equals nn for every n≥7n\ge 7. Their January 26, 2026 preprint proves this only in a separated range, not for all orders.

Known results

  • Earlier work (2023) proved the asymptotic formula sat⁡k(n,Berge-Kℓ)∼ℓ−2k−1n\operatorname{sat}_k(n,\mathrm{Berge}\text{-}K_\ell)\sim \frac{\ell-2}{k-1}n for fixed k,ℓ≥3k,\ell\ge 3.
  • For the case at issue, it gave sat⁡3(n,Berge-K4)≤n\operatorname{sat}_3(n,\mathrm{Berge}\text{-}K_4)\le n for odd nn and at most n+1n+1 for even nn, for n≥10n\ge 10, while leaving exact determination open.

January 26, 2026 partial result

The preprint proves sat⁡3(n,Berge-K4)=n\operatorname{sat}_3(n,\mathrm{Berge}\text{-}K_4)=n for n=5,7,8n=5,7,8 and n≥96n\ge 96, and proves sat⁡3(6,Berge-K4)=5\operatorname{sat}_3(6,\mathrm{Berge}\text{-}K_4)=5. It explicitly leaves 9≤n≤959\le n\le 95 unresolved and conjectures equality for every n≥7n\ge 7.

Current status (as of October 2026): The values are settled for n=5,6,7,8n=5,6,7,8 and n≥96n\ge 96, while 9≤n≤959\le n\le 95 remain open; the conjecture is not solved.

Sources

Solutions 0

No solutions have been posted yet.