Maximizing the number of x-colorings of 4-chromatic graphs

In this article, we reduce this problem to a finite family of graphs. We show that there exists a finite family F of connected 4-chromatic graphs such that if the number of x-colorings of every graph G in F is less than (x)↓4(x−1)|V(G)|−4 then the conjecture holds to be true.