Ghosh et al.'s conjecture on even-length paths in planar graphs
For a finite simple graph , let be the number of unlabeled, not necessarily induced copies of in . Define
Let denote the path on vertices, so has even length . Ghosh et al.'s conjecture. For every fixed integer ,
The lower bound is supplied by blowing up one bipartition class of a cycle , while the conjectured matching upper bound remained to be proved in the source. The corresponding conjecture has since been resolved by Lv, Győri, He, Salia, Tompkins and Zhu.
References
Status
- Solved: Zhen Liu and Chuanshu Wu. The maximum number of paths of even length in a planar graph (arXiv preprint, 2026) https://arxiv.org/html/2607.27284
Source: Zhen Liu and Chuanshu Wu, “The maximum number of paths of even length in a planar graph”, arXiv:2607.27284 (2026).
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
No solutions have been posted yet.