𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Almost Given Length Cycles in Digraphs

✍ Scribed by Raphael Yuster


Book ID
106047712
Publisher
Springer Japan
Year
2008
Tongue
English
Weight
92 KB
Volume
24
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Cycles of given length in oriented graph
✍ Luke Kelly; Daniela KΓΌhn; Deryk Osthus πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 248 KB
Cycles in dense digraphs
✍ Maria Chudnovsky; Paul Seymour; Blair Sullivan πŸ“‚ Article πŸ“… 2008 πŸ› Springer-Verlag 🌐 English βš– 347 KB
Destroying cycles in digraphs
✍ Molly Dunkum; Peter Hamburger; Attila PΓ³r πŸ“‚ Article πŸ“… 2011 πŸ› Springer-Verlag 🌐 English βš– 194 KB
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