Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For a regular tournament TT of odd order nn, let cm(T)cm(T) be the number of cycles of length mm in TT. It is ll known according to U. Colombo (1964) that c4(T)≤c4(RLTn), where RLTn is the unique regular locally transitive tournament of order nn. In turn, in 1968, A. Kotzig proved that c4(DRn)≤c4(T)c4(DRn)≤c4(T), where DRnDRn is a doubly-regular tournament of order nn. Hover, the spectral tools allow us to simply show that the converse inequality c5(RLTn)≤c5(T)≤c5(DRn) holds. Recently  have proved that c6(T)≤c6(DRn)c6(T)≤c6(DRn) and conjectured that c6(RLTn)≤c6(T). For these values of mm, the same results can be also formulated for the trace trm(T)trm(T) of the mmth por of the adjacency matrix of TT. ( consider this quantity here because it equals the number of closed walks of length mm in TT.) In the present paper,  determine c7(DRn)c7(DRn) and c7(RLTn). Comparing c7(DRn)c7(DRn) with c7(RLTn) yields the inequality c7(RLTn)<c7(DRn), while tr7(DRn)<tr7(RLTn) for n≥7n≥7.  also present some additional arguments which make it possible to suggest that for each odd n≥9n≥9, the two-sided bounds c7(RLTn)≤c7(T)≤c7(DRn) and tr7(DRn)≤tr7(T)≤tr7(RLTn) hold.
['Sergey Valerievich Savchenko']
I am writing a research paper on a idea On the number of 7-cycles in regular n-tournaments
[{"from": "human", "value": "I am writing a research paper on a idea On the number of 7-cycles in regular n-tournaments"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For a regular tournament TT of odd order nn, let cm(T)cm(T) be the number of cycles of length mm in TT. It is ll known according to U. Colombo (1964) that c4(T)\u2264c4(RLTn), where RLTn is the unique regular locally transitive tournament of order nn. In turn, in 1968, A. Kotzig proved that c4(DRn)\u2264c4(T)c4(DRn)\u2264c4(T), where DRnDRn is a doubly-regular tournament of order nn. Hover, the spectral tools allow us to simply show that the converse inequality c5(RLTn)\u2264c5(T)\u2264c5(DRn) holds. Recently  have proved that c6(T)\u2264c6(DRn)c6(T)\u2264c6(DRn) and conjectured that c6(RLTn)\u2264c6(T). For these values of mm, the same results can be also formulated for the trace trm(T)trm(T) of the mmth por of the adjacency matrix of TT. ( consider this quantity here because it equals the number of closed walks of length mm in TT.) In the present paper,  determine c7(DRn)c7(DRn) and c7(RLTn). Comparing c7(DRn)c7(DRn) with c7(RLTn) yields the inequality c7(RLTn)<c7(DRn), while tr7(DRn)<tr7(RLTn) for n\u22657n\u22657.  also present some additional arguments which make it possible to suggest that for each odd n\u22659n\u22659, the two-sided bounds c7(RLTn)\u2264c7(T)\u2264c7(DRn) and tr7(DRn)\u2264tr7(T)\u2264tr7(RLTn) hold."}]