𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Destroying cycles in digraphs

✍ Scribed by Molly Dunkum; Peter Hamburger; Attila Pór

Book ID
106167792
Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
194 KB
Volume
31
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycles in dense digraphs
Cycles in dense digraphs
✍ Maria Chudnovsky; Paul Seymour; Blair Sullivan 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 347 KB
Short cycles in digraphs
Short cycles in digraphs
✍ Tsuyoshi Nishimura 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 188 KB

Caccetta and Haggkvist [l] conjectured that every digraph with n vertices and minimum outdegree k contains a directed cycle of length at most [n/k]. With regard to this conjecture, Chvatal and Szemeredi [2] proved that if G is a digraph with n vertices and if each of these vertices has outdegree at

Oriented hamilton cycles in digraphs
Oriented hamilton cycles in digraphs
✍ Roland Häggkvist; Andrew Thomason 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 473 KB

## Abstract We show that a directed graph of order __n__ will contain __n__‐cycles of every orientation, provided each vertex has indegree and outdegree at least (1/2 + __n__^‐1/6^)__n__ and __n__ is sufficiently large. © 1995 John Wiley & Sons, Inc.