Maximal chromatic polynomial of a graph with fixed chromatic number

71 Views Asked by At

Consider all the graphs with $n$ vertices and whose chromatic number is $k$, note that the graph does not have to be connected. What are the graphs with the maximal chromatic polynomial among those graphs? I think that the answer should be the graphs consisting of a $k$-clique plus $n-k$ isolated vertices, is it true? How to prove this?