Answers are grounded in this paper and cite their sources.
The question of the maximum number ex(m,n,C₂ₖ) of edges in an m by n bipartite graph without a cycle of length 2 k is addressed in this note. For each k ≥ 2 , it is shown that $ex(m,n,C₂ₖ) ≤ {cases} (2k-3)[(mn)k+1/2k + m + n] & if k is odd,\\[2pt] (2k-3)[mk+2/2k\, n1/2 + m + n] & if k is even.\\ {cases}$
No takes yet. Share an insight, caveat, or question.
Naor et al. (2005) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: