Note
Short cycles in directed graphs

https://doi.org/10.1016/0095-8956(83)90059-XGet rights and content
Under an Elsevier user license
open archive

Abstract

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

Cited by (0)