Short cycles in digraphs

Research output: Contribution to journalArticle

16 Citations (Scopus)

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 {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.

Original languageEnglish
Pages (from-to)295-298
Number of pages4
JournalDiscrete Mathematics
Volume72
Issue number1-3
DOIs
Publication statusPublished - 1988
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this