2 problems

Let $K_n$ be the complete graph on $n$ vertices, and let $\Phi$ be the potential function on colorings of $E(K_n)$ with $n-1$ colors. Consider the process that starts from a random…

Let $K_n$ be the complete graph on $n$ vertices, and let $\mathcal{G}_n$ be the graph whose vertices are all colorings of $E(K_n)$ with colors ${1,\ldots,n-1}$, with two colorings…