Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-05T22:25:52.724Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  14 August 2017

BORIS BUKH
Affiliation:
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, USA (e-mail: [email protected])
ZILIN JIANG
Affiliation:
Department of Mathematics, Technion–Israel Institute of Technology, Technion City, Haifa 32000, Israel (e-mail: [email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Due to a calculation error, the constant in the main theorem is not $80 \sqrt{k\log k}$ but $80\sqrt{k} \log k$. The error was discovered by Xizhi Liu.

For a new discussion on the limit of the method used in this paper see the revised arXiv version of the paper.

Type
Erratum
Creative Commons
This is a work of the U.S. Government and is not subject to copyright protection in the United States.
Copyright
Copyright © Cambridge University Press 2017

References

[1] Bukh, B. and Jiang, Z. (2017) A bound on the number of edges in graphs without an even cycle. Combin. Probab. Comput. 26 115. arXiv:1403.1601 Google Scholar