Answers are grounded in this paper and cite their sources.
We show that, for each fixed k, an n-vertex graph not containing a cycle of length 2k has at most 80√klog k· n1+1/k+O(n) edges.
No takes yet. Share an insight, caveat, or question.
Zilin Jiang (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: