抄録
Caccetta and Häggkvist [1] conjectured that every digraph with n vertices and minimum outdegree k contains a directed cycle of length at most {plus 45 degree rule}n/k. With regard to this conjecture, Chvátal and Szemerédi [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 |
ジャーナル | Discrete Mathematics |
巻 | 72 |
号 | 1-3 |
DOI | |
出版ステータス | Published - 1988 12月 |
外部発表 | はい |
ASJC Scopus subject areas
- 理論的コンピュータサイエンス
- 離散数学と組合せ数学