Short Cycles in Digraphs

研究成果: Article査読

抄録

Caccetta and Häggkvist [1] 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, Chvátal and Szemérldi [2] proved that if G is a digraph with n vertices and if each of these vertices has outdegree at least k, then G contains a cycle of length at most (n/k)+2500. Our result is an improvement of this result.

本文言語English
ページ(範囲)295-298
ページ数4
ジャーナルAnnals of Discrete Mathematics
38
C
DOI
出版ステータスPublished - 1988 1 1
外部発表はい

ASJC Scopus subject areas

  • 離散数学と組合せ数学

フィンガープリント

「Short Cycles in Digraphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル