Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  show in this paper that in every $3$-coloring of the edges of $K^n$ all but $o(n)$ of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that  can partition  all  the vertices into at most 17 monochromatic cycles, improving the best known bounds. If the colors of the three monochromatic cycles must be different then one can cover $({3\over 4}-o(1))n$ vertices and this is close to best possible.
['András Gyárfás', 'Miklós Ruszinkó', 'Gábor N. Sárközy', 'Endre Szemerédi']
I am writing a research paper on a idea Partitioning 3-colored complete graphs into three monochromatic cycles ∗
[{"from": "human", "value": "I am writing a research paper on a idea Partitioning 3-colored complete graphs into three monochromatic cycles \u2217"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  show in this paper that in every $3$-coloring of the edges of $K^n$ all but $o(n)$ of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that  can partition  all  the vertices into at most 17 monochromatic cycles, improving the best known bounds. If the colors of the three monochromatic cycles must be different then one can cover $({3\\over 4}-o(1))n$ vertices and this is close to best possible."}]