Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 295-298 |
Number of pages | 4 |
Journal | Annals of Discrete Mathematics |
Volume | 38 |
Issue number | C |
DOIs | |
Publication status | Published - 1988 Jan 1 |
Externally published | Yes |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics