← All problems

Connected Berge-path Turán conjecture

For integers r≥2r\ge 2, n≥1n\ge 1, and k≥2k\ge 2, determine ex⁡rconn(n,BPk)\operatorname{ex}^{\mathrm{conn}}_r(n,\mathcal{BP}_k), the maximum number of edges in an nn-vertex, rr-uniform, connected hypergraph containing no Berge path on kk vertices. Here a Berge path on kk vertices is a sequence of distinct vertices and distinct edges v1,e1,v2,…,ek−1,vkv_1,e_1,v_2,\ldots,e_{k-1},v_k such that vi,vi+1∈eiv_i,v_{i+1}\in e_i for every i∈[k−1]i\in[k-1]. The conjectured formula is to be established, in particular, for sufficiently large nn in the range r+3≤k≤2r+1r+3\le k\le 2r+1.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

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 r+3≤k≤2r+1r+3\leq k\leq 2r+1.

Known results

  • Gerbner (2024) determined the sufficiently large-nn cases with k≤rk\leq r and treated k=r+1k=r+1 asymptotically.
  • Zhao, Gerbner, and Zhou (2026) proved the conjectured formula for sufficiently large nn when k≥2r+2k\geq 2r+2.

October 23, 2026 claimed extension

Li and Luo’s preprint reports the extremal number for sufficiently large nn throughout r+3≤k≤2r+1r+3\leq k\leq 2r+1, 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-kk range is established, and Li and Luo claim the remaining range asymptotically, but that claim is unverified.

Sources

Solutions 0

No solutions have been posted yet.