Chen–He–Xie Berge-K4 saturation conjecture
For every integer , the saturation number of the complete graph in three-uniform Berge hypergraphs satisfies . Equivalently, every three-uniform Berge--saturated hypergraph on vertices has at least hyperedges, and constructions with exactly hyperedges exist.
References
- Saturation in three-uniform Berge hypergraphs: the five-star spectrum and the K4 saturation number — arXiv — XuanYu Cao, Yuan Lai, Chunxiang Wang
Source: arXiv
Progress summary
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- saturation number equals for every . 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 for fixed .
- For the case at issue, it gave for odd and at most for even , for , while leaving exact determination open.
January 26, 2026 partial result
The preprint proves for and , and proves . It explicitly leaves unresolved and conjectures equality for every .
Current status (as of October 2026): The values are settled for and , while remain open; the conjecture is not solved.
Sources
Solutions 0
No solutions have been posted yet.