Connected Berge-path Turán conjecture
For integers , , and , determine , the maximum number of edges in an -vertex, -uniform, connected hypergraph containing no Berge path on vertices. Here a Berge path on vertices is a sequence of distinct vertices and distinct edges such that for every . The conjectured formula is to be established, in particular, for sufficiently large in the range .
References
- The Turán number of Berge paths in connected hypergraphs — arXiv — Yupei Li, Ruth Luo
Source: arXiv
Progress summary
A new unrefereed paper claims to settle the remaining middle range of this conjecture for sufficiently large hypergraphs, but the claim has not been independently checked.
The conjecture concerns the maximum number of edges in a connected uniform hypergraph avoiding a Berge path of prescribed length. It was posed by Győri, Salia, and Zamora; the disputed range is .
Known results
- Gerbner (2024) determined the sufficiently large- cases with and treated asymptotically.
- Zhao, Gerbner, and Zhou (2026) proved the conjectured formula for sufficiently large when .
October 23, 2026 claimed extension
Li and Luo’s preprint reports the extremal number for sufficiently large throughout , completing the conjectured formula in the remaining asymptotic range. This is a claimed advance from an unrefereed preprint, with no independent verification in the retrieved sources.
Current status (as of October 2026): The large- range is established, and Li and Luo claim the remaining range asymptotically, but that claim is unverified.
Solutions 0
No solutions have been posted yet.