Related papers: Counting proper colourings in 4-regular graphs via…
We present exact calculations of the zero-temperature partition function (chromatic polynomial) and the (exponent of the) ground-state entropy $S_0$ for the $q$-state Potts antiferromagnet on families of cyclic and twisted cyclic (M\"obius)…
In this paper, we study estimation of parameters in a two-parameter Potts model with $q$ colors and coupling matrix $A_N$. We characterize concrete sufficient conditions for existence of the pseudo-likelihood estimator of the Potts model,…
In 1985, Erd\H{o}s and Ne\'{s}etril conjectured that the strong edge-coloring number of a graph is bounded above by ${5/4}\Delta^2$ when $\Delta$ is even and ${1/4}(5\Delta^2-2\Delta+1)$ when $\Delta$ is odd. They gave a simple construction…
We study the asymptotic limiting function $W({G},q) = \lim_{n \to \infty}P(G,q)^{1/n}$, where $P(G,q)$ is the chromatic polynomial for a graph $G$ with $n$ vertices. We first discuss a subtlety in the definition of $W({G},q)$ resulting from…
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…
We present exact calculations of the Potts model partition function $Z(G,q,v)$ for arbitrary $q$ and temperature-like variable $v$ on self-dual strip graphs $G$ of the square lattice with fixed width $L_y$ and arbitrarily great length $L_x$…
We present several results on the mixing time of the Glauber dynamics for sampling from the Gibbs distribution in the ferromagnetic Potts model. At a fixed temperature and interaction strength, we study the interplay between the maximum…
In this paper we present exact calculations of the partition function $Z$ of the $q$-state Potts model and its generalization to real $q$, for arbitrary temperature on $n$-vertex strip graphs, of width $L_y=2$ and arbitrary length, of the…
Recent results establish for 2-spin antiferromagnetic systems that the computational complexity of approximating the partition function on graphs of maximum degree D undergoes a phase transition that coincides with the uniqueness phase…
For fixed integers p and q, let f(n,p,q) denote the minimum number of colors needed to color all of the edges of the complete graph K_n such that no clique of p vertices spans fewer than q distinct colors. A construction is given which…
Fixing $\beta \ge 0$ and an integer $q \ge 2$, consider the ferromagnetic $q$-Potts measures $\mu_n^{\beta,B}$ on finite graphs ${\sf G}_n$ on $n$ vertices, with external field strength $B \ge 0$ and the corresponding random cluster…
The Petersen colouring conjecture states that every bridgeless cubic graph admits an edge-colouring with $5$ colours such that for every edge $e$, the set of colours assigned to the edges adjacent to $e$ has cardinality either $2$ or $4$,…
Here we observe that list coloring in graph theory coincides with the zero-temperature antiferromagnetic Potts model with an external field. We give a list coloring polynomial that equals the partition function in this case. This is…
In this paper we prove that for any integer $q\geq 5$, the anti-ferromagnetic $q$-state Potts model on the infinite $\Delta$-regular tree has a unique Gibbs measure for all edge interaction parameters $w\in [1-q/\Delta,1)$, provided…
We give a fully polynomial-time approximation scheme (FPTAS) to count the number of independent sets on almost every $\Delta$-regular bipartite graph if $\Delta\ge 53$. In the weighted case, for all sufficiently large integers $\Delta$ and…
We give a fully polynomial-time approximation scheme (FPTAS) to count the number of $q$-colorings for $k$-uniform hypergraphs with maximum degree $\Delta$ if $k\ge 28$ and $q >357\Delta^{\frac{14}{k-14}}$ . We also obtain a polynomial-time…
We consider a problem proposed by Linial and Wilf to determine the structure of graphs that allows the maximum number of $q$-colorings among graphs with $n$ vertices and $m$ edges. Let $T_r(n)$ denote the Tur\'{a}n graph - the complete…
A graph $G$ is $(d_1,\ldots,d_k)$-colorable if its vertex set can be partitioned into $k$ sets $V_1,\ldots,V_k$, such that for each $i\in\{1, \ldots, k\}$, the subgraph of $G$ induced by $V_i$ has maximum degree at most $d_i$. The Four…
Let $\mathcal{C}_4(n)$ be the family of all connected $4$-chromatic graphs of order $n$. Given an integer $x\geq 4$, we consider the problem of finding the maximum number of $x$-colorings of a graph in $\mathcal{C}_4(n)$. It was conjectured…
We present exact calculations of partition function $Z$ of the $q$-state Potts model with next-nearest-neighbor spin-spin couplings, both for the ferromagnetic and antiferromagnetic case, for arbitrary temperature, on $n$-vertex strip…