On the distribution of cycle lengths in graphs

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

The set of different cycle lengths of a graph G is denoted by C(G). We study how the distribution of C(G) depends on the minimum degree of G. We prove two results indicating that C(G) is dense in some sense. These results lead to the solution of a conjecture of Erdös and Hajnal stating that for suitable positive constants a, b the following holds: (Formula Presented.) where δ(G) denotes the minimum degree of G.

Original languageEnglish
Pages (from-to)441-462
Number of pages22
JournalJournal of Graph Theory
Volume8
Issue number4
DOIs
Publication statusPublished - 1984

Fingerprint

Cycle Length
Minimum Degree
Graph in graph theory
Denote

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

On the distribution of cycle lengths in graphs. / Gyárfás, A.; Komlós, J.; Szemerédi, E.

In: Journal of Graph Theory, Vol. 8, No. 4, 1984, p. 441-462.

Research output: Contribution to journalArticle

@article{425e68022a804dfeb4a52722cf01c200,
title = "On the distribution of cycle lengths in graphs",
abstract = "The set of different cycle lengths of a graph G is denoted by C(G). We study how the distribution of C(G) depends on the minimum degree of G. We prove two results indicating that C(G) is dense in some sense. These results lead to the solution of a conjecture of Erd{\"o}s and Hajnal stating that for suitable positive constants a, b the following holds: (Formula Presented.) where δ(G) denotes the minimum degree of G.",
author = "A. Gy{\'a}rf{\'a}s and J. Koml{\'o}s and E. Szemer{\'e}di",
year = "1984",
doi = "10.1002/jgt.3190080402",
language = "English",
volume = "8",
pages = "441--462",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "4",

}

TY - JOUR

T1 - On the distribution of cycle lengths in graphs

AU - Gyárfás, A.

AU - Komlós, J.

AU - Szemerédi, E.

PY - 1984

Y1 - 1984

N2 - The set of different cycle lengths of a graph G is denoted by C(G). We study how the distribution of C(G) depends on the minimum degree of G. We prove two results indicating that C(G) is dense in some sense. These results lead to the solution of a conjecture of Erdös and Hajnal stating that for suitable positive constants a, b the following holds: (Formula Presented.) where δ(G) denotes the minimum degree of G.

AB - The set of different cycle lengths of a graph G is denoted by C(G). We study how the distribution of C(G) depends on the minimum degree of G. We prove two results indicating that C(G) is dense in some sense. These results lead to the solution of a conjecture of Erdös and Hajnal stating that for suitable positive constants a, b the following holds: (Formula Presented.) where δ(G) denotes the minimum degree of G.

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

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

U2 - 10.1002/jgt.3190080402

DO - 10.1002/jgt.3190080402

M3 - Article

VL - 8

SP - 441

EP - 462

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 4

ER -