Math-1371 · mathematics · Graph theory

Math-1371

Counting 3-colorings of the hex lattice

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Tile the Euclidean plane by unit equilateral triangles. For each integer $n\ge1$, take the regular hexagonal patch whose six sides consist of $n$ triangle edges. Identify each side with its opposite side by translation, matching the subdivision vertices. This quotient is a triangulated torus $T_n$. Keep the resulting cellular map structure, including distinct edges if identifications produce parallel edges at a small value of $n$.

Let $H_n$ be the geometric dual of this torus triangulation: it has one vertex for each triangular face of $T_n$, and an edge across each primal edge joining its incident face vertices. Thus $H_n$ is the toroidal hexagonal lattice map associated with this specific periodic patch. There are $6n^2$ triangular faces before identifications, so $|V(H_n)|=6n^2$.

For any finite graph $G$, write $P_G(3)$ for the number of maps $c:V(G)\to\{1,2,3\}$ assigning different labels to the endpoints of every edge. Color labels are distinguished; colorings related by a global color permutation are counted separately. The problem is to prove convergence and determine the exact value of \[ \lim_{n\to\infty}P_{H_n}(3)^{1/(6n^2)}. \] This is the exponential growth factor per vertex for vertex colorings of the stated periodic hexagonal graphs. It is not an edge-coloring or face-coloring model. The specified torus identifications are part of the sequence, rather than free boundary conditions on a planar patch.

Short English statement

Find the limiting number of proper three-colorings per vertex for the specified periodic hexagonal lattice on a torus.

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.