✦ LIBER ✦

Large cycles in graphs

✍ Scribed by J.A. Bondy

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 485 KB
Volume: 1
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(71)90019-7

No coin nor oath required. For personal study only.

✦ Synopsis

Abstrtct. The paper i~ concerned with the existence of cycles of specified length in finite undirected graphs and with the question of how this depends on the numbers of vertit.¢s and edges ~ ulje graph, In particular, a conjecture ofP. Erdiss that every graph of order n and size at least ](n 2-5n ¢ ! 4i has a cycle of length n-! is proved. A lower bound for the cirt~zmterence of a non-separab~ graph in terms of its vertex degrees is also given.

📜 SIMILAR VOLUMES

Partitioning random graphs into large cy

Partitioning random graphs into large cycles

✍ A.M. Frieze 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 833 KB

Let r 3 1 be a tied positive integer. We give the limiting distribution for the probability that the vertices of a random graph can be partitioned equitably into I cycles.

Long cycles in graphs with large degree

Long cycles in graphs with large degree sums

✍ Douglas Bauer; H.J. Veldman; A. Morgana; E.F. Schmeichel 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 764 KB

Long paths and large cycles in finite gr

Long paths and large cycles in finite graphs

✍ Hikoe Enomoto 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 503 KB

Cycles and paths in graphs with large mi

Cycles and paths in graphs with large minimal degree

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

## Abstract Let __G__ be a simple graph of order __n__ and minimal degree > cn (0 < c < 1/2). We prove that (1) There exist __n__~0~ = __n__~0~(__c__) and __k__ = __k__(__c__) such that if __n__ > __n__~0~ and __G__ contains a cycle __C__~__t__~ for some __t__ > 2__k__, then __G__ contains a cycle

On large matchings and cycles in sparse

On large matchings and cycles in sparse random graphs

✍ A.M Frieze 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 666 KB

Let k be a fixed positive integer. A graph H has property Mk if it contains [½k] edge disjoint hamilton cycles plus a further edge disjoint matching which leaves at most one vertex isolated, if k is odd. Let p = c/n, where c is a large enough constant. We show that G,,p a.s. contains a vertex induce

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