2008/06/02 by Dhananjay P. Mehendale, Mehendale, Dhananjay P.
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #FOS: Mathematics #General Mathematics (math.GM) #Rings, Modules, and Algebras #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.0806.0251
openalex publication_date 2008/06/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
P. J. Kelly conjectured in 1968 that every diregular tournament on (2n+1) points can be decomposed in directed Hamilton circuits [1]. We define so called leading diregular tournament on (2n+1) points and show that it can be decomposed in directed Hamilton circuits when (2n+1) is a prime number. When (2n+1) is not a prime number this method does not work and we will need to devise some another method. We also propose a general method to find Hamilton decomposition of certain tournament for all sizes.