Cycles of even length in graphs

J. A. Bondy, M. Simonovits

Research output: Contribution to journalArticle

186 Citations (Scopus)

Abstract

In this paper we solve a conjecture of P. Erdös by showing that if a graph Gn has n vertices and at least 100kn1+ 1 k edges, then G contains a cycle C2l of length 2l for every integer l ∈ [k, kn 1 k]. Apart from the value of the constant this result is best possible. It is obtained from a more general theorem which also yields corresponding results in the case where Gn has only cn(log n)α edges (α ≥ 1).

Original languageEnglish
Pages (from-to)97-105
Number of pages9
JournalJournal of Combinatorial Theory. Series B
Volume16
Issue number2
DOIs
Publication statusPublished - 1974

Fingerprint

Cycle
Graph in graph theory
Integer
Theorem

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Cycles of even length in graphs. / Bondy, J. A.; Simonovits, M.

In: Journal of Combinatorial Theory. Series B, Vol. 16, No. 2, 1974, p. 97-105.

Research output: Contribution to journalArticle

@article{cdd88e9d66dd48bc8012453f705f0bf5,
title = "Cycles of even length in graphs",
abstract = "In this paper we solve a conjecture of P. Erd{\"o}s by showing that if a graph Gn has n vertices and at least 100kn1+ 1 k edges, then G contains a cycle C2l of length 2l for every integer l ∈ [k, kn 1 k]. Apart from the value of the constant this result is best possible. It is obtained from a more general theorem which also yields corresponding results in the case where Gn has only cn(log n)α edges (α ≥ 1).",
author = "Bondy, {J. A.} and M. Simonovits",
year = "1974",
doi = "10.1016/0095-8956(74)90052-5",
language = "English",
volume = "16",
pages = "97--105",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Cycles of even length in graphs

AU - Bondy, J. A.

AU - Simonovits, M.

PY - 1974

Y1 - 1974

N2 - In this paper we solve a conjecture of P. Erdös by showing that if a graph Gn has n vertices and at least 100kn1+ 1 k edges, then G contains a cycle C2l of length 2l for every integer l ∈ [k, kn 1 k]. Apart from the value of the constant this result is best possible. It is obtained from a more general theorem which also yields corresponding results in the case where Gn has only cn(log n)α edges (α ≥ 1).

AB - In this paper we solve a conjecture of P. Erdös by showing that if a graph Gn has n vertices and at least 100kn1+ 1 k edges, then G contains a cycle C2l of length 2l for every integer l ∈ [k, kn 1 k]. Apart from the value of the constant this result is best possible. It is obtained from a more general theorem which also yields corresponding results in the case where Gn has only cn(log n)α edges (α ≥ 1).

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

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

U2 - 10.1016/0095-8956(74)90052-5

DO - 10.1016/0095-8956(74)90052-5

M3 - Article

AN - SCOPUS:0002558566

VL - 16

SP - 97

EP - 105

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 2

ER -