2008/05/23 by Dhananjay P. Mehendale, Mehendale, Dhananjay P.
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #FOS: Mathematics #General Mathematics (math.GM) #Limits and Structures in Graph Theory #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.0805.3631
openalex publication_date 2008/05/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.