Chemins Et Circuits Dans Les Graphes Orientes

Let D be a digraph with n vertices: we give sufficient conditions and conjectures on the number of arcs of D to insure that D has a directed cycle or a directed path of given length l , with more emphasis on the cases l = n, n - 1 or l small. We study the case where D is any digraph and the case where D is strong.