Even cycles in graphs with many odd cycles (Q5935601)

It is shown that if \(G\) is a graph of order \(n\) which contains a triangle, a cycle of length \(n\) or \(n-1\) and at least \(cn\) odd cycles of different lengths for some positive constant \(c\), then there exists some positive constant \(k=k(c)\) such that \(G\) contains at least \(kn^{1/6}\) even cycles of different lengths. Some related results and open problems are also presented.