✦ LIBER ✦

Disjoint Directed Cycles

✍ Scribed by Noga Alon

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 295 KB
Volume: 68
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1996.0062

No coin nor oath required. For personal study only.

✦ Synopsis

It is shown that there exists a positive = so that for any integer k, every directed graph with minimum outdegree at least k contains at least =k vertex disjoint cycles. On the other hand, for every k there is a digraph with minimum outdegree k which does not contain two vertex or edge disjoint cycles of the same length.

📜 SIMILAR VOLUMES

Edge-disjoint cycles in regular directed

Edge-disjoint cycles in regular directed graphs

✍ Alon, Noga; McDiarmid, Colin; Molloy, Michael 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB 👁 3 views

We prove that any k-regular directed graph with no parallel edges contains a collection of at least fl(k2) edge-disjoint cycles; we conjecture that in fact any such graph contains a collection of at least ( lCi1 ) disjoint cycles, and note that this holds for k 5 3. o 1996

Disjoint circuits in the cartesian produ

Disjoint circuits in the cartesian product of two directed cycles

✍ Stephen Curran 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 291 KB

## Abstract We show that the Cartesian product of two directed cycles __Z__~__a__~ X __Z__~__b__~ has __r__ disjointly embedded circuits __C__~1~, __C__~2~, ⃛, __C__~r~ with specified knot classes knot__(C~i~) = (m~i~, n~i~)__, for __i__ = 1, 2, ⃛, __r__, if and only if there exist relatively prime

Disjoint Cycles in Directed Graphs on th

Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle

✍ G.L. Ding; A. Schrijver; P.D. Seymour 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 203 KB

We give necessary and sufficient conditions for a directed graph embedded on the torus or the Klein bottle to contain pairwise disjoint circuits, each of a given orientation and homotopy, and in a given order. For the Klein bottle, the theorem is new. For the torus, the theorem was proved before by

Edge disjoint cycles in graphs

✍ Li Hao 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 419 KB

Disjoint directed quadrilaterals in a di

Disjoint directed quadrilaterals in a directed graph

✍ Danhong Zhang; Hong Wang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract Let __D__ be a directed graph of order 4__k__, where __k__ is a positive integer. Suppose that the minimum degree of __D__ is at least 6__k__ − 2. We show that __D__ contains __k__ disjoint directed quadrilaterals with only one exception. © 2005 Wiley Periodicals, Inc. J Graph Theory

Disjoint cycles in star-free graphs

✍ Markus, Lisa R.; Snevily, Hunter S. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 322 KB 👁 3 views

A graph is claw-free if it does not contain K l , 3 as an induced subgraph. It is Kl,,-free if it does not contain K l , r as an induced subgraph. We show that if a graph is Kl,,-free ( r 2 4), only p + 2r -1 edges are needed to insure that G has t w o disjoint cycles. As an easy consequence w e ge