加载中…
Let be a graph of order and be the chromatic polynomial of . Dong, Ge, Gong, Ning, Ouyang, and Tay (J. Graph Theory 96(2021) 343) conjectured that holds for all and . We prove this conjecture for all and , in which is the maximum degree of .

生成讲解博客的中文版本

生成AI智能校验的中文版本