Asymptotic conjecture for the number of even-length paths in planar graphs
Let be a path of length , and let denote the maximum number of copies of in a planar graph on vertices. Even-length path conjecture. For every positive integer ,
This conjectures the asymptotic value of the generalized extremal function for even-length paths; the source proposes it together with the corresponding odd-length formula, and no resolution is supplied here.
References
- Debarun Ghosh, Ervin Győri, Ryan R. Martin, Addisu Paulos, Nika Salia, Chuanqi Xiao and Oscar Zamora, “The Maximum Number of Paths of Length Four in a Planar Graph”, arXiv:2004.09207 (2021).
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.