Abstract
We show that, for each fixed k, an n-vertex graph not containing a cycle of length 2k has at most 80klogk.n1+1/k + O(n) edges.
Original language | English (US) |
---|---|
Pages (from-to) | 1-15 |
Number of pages | 15 |
Journal | Combinatorics Probability and Computing |
Volume | 26 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1 2017 |
Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Statistics and Probability
- Computational Theory and Mathematics
- Applied Mathematics