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

Boris Bukh; Zilin Jiang

doi:10.1017/S0963548316000134

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

Boris Bukh, Zilin Jiang

Research output: Contribution to journal › Article › peer-review

29 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.n^1+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	https://doi.org/10.1017/S0963548316000134
State	Published - Jan 1 2017
Externally published	Yes

ASJC Scopus subject areas

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

Access to Document

10.1017/S0963548316000134

Cite this

@article{4b84656ee1d647fcbe74a4132d4004e9,

title = "A Bound on the Number of Edges in Graphs Without an even Cycle",

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.",

author = "Boris Bukh and Zilin Jiang",

note = "Funding Information: Supported in part by US taxpayers through NSF grant DMS-1301548. Publisher Copyright: {\textcopyright} 2016 Cambridge University Press.",

year = "2017",

month = jan,

day = "1",

doi = "10.1017/S0963548316000134",

language = "English (US)",

volume = "26",

pages = "1--15",

journal = "Combinatorics Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

number = "1",

}

TY - JOUR

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

AU - Bukh, Boris

AU - Jiang, Zilin

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84964018983&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84964018983&partnerID=8YFLogxK

U2 - 10.1017/S0963548316000134

DO - 10.1017/S0963548316000134

M3 - Article

AN - SCOPUS:84964018983

SN - 0963-5483

VL - 26

SP - 1

EP - 15

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

IS - 1

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this