Short cycles in directed graphs

V. Chvátal, E. Szemerédi

Research output: Contribution to journalArticle

20 Citations (Scopus)


It is proved that every directed graph with n vertices and minimum outdegree k contains a directed cycle of length at most n k + 2500.

Original languageEnglish
Pages (from-to)323-327
Number of pages5
JournalJournal of Combinatorial Theory, Series B
Issue number3
Publication statusPublished - Dec 1983

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Short cycles in directed graphs'. Together they form a unique fingerprint.

  • Cite this