Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract   In this note,  derive an explicit formula for the equitable chromatic number of a complete  n -partite graph  K   p  1 , p  2 ,…, p   n   . Namely, if  M  is the largest integer such that   p     i     (  mod    M)  p     i   M    (i=1,2,…,n)   then   χ     e   (K      p     1   ,p     2   ,…,p     n     )=  ∑  i=1  n  p     i   M+1  ,   where  χ   e  ( G ) is the equitable chromatic number of graph  G .
['Peter Che Bor Lam', 'Wai Chee Shiu', 'Chong Sze Tong', 'Zhong Fu Zhang']
I am writing a research paper on a idea On the equitable chromatic number of complete n -partite graphs
[{"from": "human", "value": "I am writing a research paper on a idea On the equitable chromatic number of complete n -partite graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract   In this note,  derive an explicit formula for the equitable chromatic number of a complete  n -partite graph  K   p  1 , p  2 ,\u2026, p   n   . Namely, if  M  is the largest integer such that   p     i     (  mod    M)  p     i   M    (i=1,2,\u2026,n)   then   \u03c7     e   (K      p     1   ,p     2   ,\u2026,p     n     )=  \u2211  i=1  n  p     i   M+1  ,   where  \u03c7   e  ( G ) is the equitable chromatic number of graph  G ."}]