✦ LIBER ✦

Cycle lengths in sparse graphs

✍ Scribed by Benny Sudakov; Jacques Verstraëte

Publisher: Springer-Verlag
Year: 2008
Tongue: English
Weight: 515 KB
Volume: 28
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-008-2300-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unavoidable cycle lengths in graphs

✍ Jacques Verstraete 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

## Abstract An old conjecture of Erdős states that there exists an absolute constant __c__ and a set __S__ of density zero such that every graph of average degree at least __c__ contains a cycle of length in __S__. In this paper, we prove this conjecture by showing that every graph of average degre

Distribution of Cycle Lengths in Graphs

✍ Genghua Fan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Bondy and Vince proved that every graph with minimum degree at least three contains two cycles whose lengths differ by one or two, which answers a question raised by Erdo ˝s. By a different approach, we show in this paper that if G is a graph with minimum degree d(G) \ 3k for any positive integer k,

A Note on Cycle Lengths in Graphs

✍ R.J. Gould; P.E. Haxell; A.D. Scott 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 121 KB

Graphs with k odd cycle lengths

✍ A. Gyárfás 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 481 KB

Gyarf&, A., Graphs with k odd cycle lengths, Discrete Mathematics 103 (1992) 41-48. If G is a graph with k z 1 odd cycle lengths then each block of G is either KZk+2 or contains a vertex of degree at most 2k. As a consequence, the chromatic number of G is at most 2k + 2. For a graph G let L(G) deno

Cycle lengths in graphs with large minim

Cycle lengths in graphs with large minimum degree

✍ V. Nikiforov; R. H. Schelp 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 1 views

## Abstract Our main result is the following theorem. Let __k__ ≥ 2 be an integer, __G__ be a graph of sufficiently large order __n__, and __δ__(__G__) ≥ __n__/__k__. Then: __G__ contains a cycle of length __t__ for every even integer __t__ ∈ [4, __δ__(__G__) + 1]. If __G__ is nonbipartite then

On cycle lengths in graphs of moderate d

On cycle lengths in graphs of moderate degree

✍ H. Bencherif Ait-Djafer 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 447 KB

We show that for all positive E, an integer N(E) exists such that if G is any graph of order n>N(s) with minimum degree 63324 then G contains a cycle of length 21 for each integer 1, 2<1<~/(16+s). Bondy [4] and Woodall [15] have obtained sufficient conditions for a graph to contain cycles of each le