A Bound on the Number of Edges in Graphs Without an even Cycle

Boris Bukh, Zilin Jiang

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

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 languageEnglish (US)
Pages (from-to)1-15
Number of pages15
JournalCombinatorics Probability and Computing
Volume26
Issue number1
DOIs
StatePublished - Jan 1 2017
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Statistics and Probability
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A Bound on the Number of Edges in Graphs Without an even Cycle'. Together they form a unique fingerprint.

Cite this