抜粋

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

  • Discrete Mathematics and Combinatorics

これを引用