Abstract
The question of the maximum number ex(m,n,C2k) of edges in an m by n bipartite graph without a cycle of length 2k is addressed in this note. For each $k \geq 2$, it is shown that ex(m,n,C2k) ≤ { (2k-3)[(mn)k+1/2k + m + n] if k is odd,[2pt] (2k-3)[m k+2/2k n1/2 + m + n] if k is even.
Original language | English (US) |
---|---|
Pages (from-to) | 845-849 |
Number of pages | 5 |
Journal | Combinatorics Probability and Computing |
Volume | 14 |
Issue number | 5-6 |
DOIs | |
State | Published - Nov 2005 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Statistics and Probability
- Computational Theory and Mathematics
- Applied Mathematics