The generalized outerplanar Turán conjecture for
The generalized outerplanar Turán conjecture for
Let denote the generalized outerplanar Turán number of the path on vertices, namely the maximum number of copies of in an outerplanar graph on vertices. Generalized outerplanar Turán conjecture for .
This conjectures the best asymptotic value for the generalized outerplanar Turán number of a short path beyond the 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.