Extremal conjecture for equal-degree endpoint paths of odd length
Let denote the maximum number of edges in a graph on vertices containing no path of length whose endpoints have equal degree. For odd integers and sufficiently large positive integers , consider graphs on vertices; the complete bipartite graph has edges.
Odd-length extremal conjecture. For any odd integer and sufficiently large , it holds that
Equivalently, remains extremal for paths of every odd length at least three. This extends the problem of Erdős and Hajnal on paths with equal-degree endpoints; the asserted extremality is posed as an open problem for general odd lengths.
References
- Kaizhe Chen and Jie Ma, “A problem of Erdős and Hajnal on paths with equal-degree endpoints”, arXiv:2503.19569 (2025).
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.