The generalized outerplanar Turán conjecture for P6P_6

Let fOP(n,P6)f_{\mathcal{OP}}(n,P_6) denote the generalized outerplanar Turán number of the path P6P_6 on 66 vertices, namely the maximum number of copies of P6P_6 in an outerplanar graph on nn vertices. Generalized outerplanar Turán conjecture for P6P_6.

fOP(n,P6)=11n2+Θ(n).f_{\mathcal{OP}}(n,P_6)=11n^2+\Theta(n).

This conjectures the best asymptotic value for the generalized outerplanar Turán number of a short path beyond the P5P_5 case established in the paper; determining the asserted linear-order error term remains open.

Sources & referencesView supporting material

Primary source

Ervin Győri, Addisu Paulos and Chuanqi Xiao, “Generalized outerplanar Turán number of short paths”, arXiv:2110.06921 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.