published by Dhananjay Mehendale
in 2008
and research's language is
English
Download
Abstract in English
We show that we cannot avoid the existence of at least one directed circuit of length less than or equal to (n/r) in a digraph on n vertices with out-degree greater than or equal to r. This is well-known Caccetta-Haggkvist problem.