Erratum For ‘A Bound on the Number of Edges in Graphs Without an Even Cycle’

DOI10.1017/S0963548317000396zbMath1440.05127OpenAlexW2743231734MaRDI QIDQ5373837

Boris Bukh, Zilin Jiang

Publication date: 27 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548317000396

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Extremal combinatorics (05D99)

Related Items (7)

A note on the Tur\'an number of a Berge odd cycle ⋮ Linear cycles of consecutive lengths ⋮ On the Turán Number of Generalized Theta Graphs ⋮ The spectral radius of graphs with no odd wheels ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Supersaturation of even linear cycles in linear hypergraphs ⋮ Turán numbers of theta graphs

Cites Work

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

This page was built for publication: Erratum For ‘A Bound on the Number of Edges in Graphs Without an Even Cycle’