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

BORIS BUKH, ZILIN JIANG

Source record

Source: Crossref

Published: Apr 7, 2016

DOI: 10.1017/s0963548316000134

Open original source ↗

Source abstract

We show that, for each fixed k , an n -vertex graph not containing a cycle of length 2 k has at most $80\sqrt{k\log k}\cdot n^{1+1/k}+O(n)$ edges.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.