English

The $\alpha$-representation for Tait coloring and sums over spanning trees

Combinatorics 2025-10-14 v1 Number Theory

Abstract

Consider a connected pseudograph HH such that each edge is associated with weight xex_e, xeF3x_e \in \mathbb{F}_3; T(H)\mathcal{T}(H) is the set of spanning trees of graph HH. Assume that s(H;x)=TT(H)eE(T)xes(H;{\mathbf x})=\sum_{T\in\mathcal{T}(H)} \prod_{e\in E(T)} x_e. Let GG be a maximal planar graph (arbitrary planar triangulation) such that each face FF is assigned the value α(F)=±1F3\alpha(F)=\pm 1 \in \mathbb{F}_3. Then we can associate each edge with xe=α(Fe)+α(Fe)x_e=\alpha(F'_e)+\alpha(F''_e), where FeF'_e and FeF''_e are the faces containing edge ee. Let us define the value wG(x)w_G({\mathbf x}) as (s(G/W(x);x)3)/(3)(V(G/W(x))1)/2\left(\frac{s(G/W^*({\mathbf x});{\mathbf x})}3\right)/(-3)^{\left(|V(G/W^*({\mathbf x}))| - 1\right)/2}; here (x3)\left(\frac{x}3\right) is the Legendre symbol, G/WG/W is the graph with the contracted set of vertices WW, while W(x)W^*({\mathbf x}) is a set of vertices WW, WV(G)W \subseteq V(G), with minimal cardinality such that s(G/W;x)s(G/W;{\mathbf x}) differs from zero. In the following, we prove that the number of Tait colorings for graph GG equals the tripled sum wG(x(α))w_G({\mathbf x}(\alpha)) with respect to all possible vectors α{1,1}F(G)\alpha \in \{-1, 1\}^{\mathcal F(G)} such that G/W(x(α))G/W^*({\mathbf x}(\alpha)) has an odd number of vertices, where F(G)\mathcal F(G) is the set of faces of graph GG. Keywords: maximal planar graph, Tait coloring, Laplace-Kirchhoff matrix, spanning tree.

Keywords

Cite

@article{arxiv.2510.10213,
  title  = {The $\alpha$-representation for Tait coloring and sums over spanning trees},
  author = {Ilyas Kalimullin and Eduard Lerner},
  journal= {arXiv preprint arXiv:2510.10213},
  year   = {2025}
}

Comments

7 pages, 1 figure: 3 sub-figures