Degree powers in graphs with a forbidden even cycle (Q2380265)

Summary: Let \(C_l\) denote the cycle of length \(l\). For \(p\geq 2\) and integer \(k\geq 1\), we prove that the function \[ \varphi(k,p,n)= \max\bigg\{ \sum_{u\in V(G)}d^p(u):G\text{ is a graph of order \(n\) containing no }C_{2k+2}\bigg\} \] satisfies \(\varphi(k,p,n)= kn^p(1+o(1))\). This settles a conjecture of \textit{Y. Caro} and \textit{R. Yuster} [Electron. J. Comb. 7, No.~1, Research paper R47, 14~p. (2000); printed version J. Comb. 7, No.~2 (2000; Zbl 0986.05059)]. Our proof is based on a new sufficient condition for long paths.