Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   show that the list chromatic index of the complete graph Kn is at most n. This proves the list-chromatic conjecture for complete graphs of odd order.  also prove the asymptotic result that for a simple graph with maximum degree d the list chromatic index exceeds d by at most O(d2/3√log d).
['Roland Häggkvist', 'Jeannette C. M. Janssen']
I am writing a research paper on a idea New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
[{"from": "human", "value": "I am writing a research paper on a idea New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   show that the list chromatic index of the complete graph Kn is at most n. This proves the list-chromatic conjecture for complete graphs of odd order.  also prove the asymptotic result that for a simple graph with maximum degree d the list chromatic index exceeds d by at most O(d2/3\u221alog d)."}]