The $\alpha$-representation for Tait coloring and sums over spanning trees
Abstract
Consider a connected pseudograph such that each edge is associated with weight , ; is the set of spanning trees of graph . Assume that . Let be a maximal planar graph (arbitrary planar triangulation) such that each face is assigned the value . Then we can associate each edge with , where and are the faces containing edge . Let us define the value as ; here is the Legendre symbol, is the graph with the contracted set of vertices , while is a set of vertices , , with minimal cardinality such that differs from zero. In the following, we prove that the number of Tait colorings for graph equals the tripled sum with respect to all possible vectors such that has an odd number of vertices, where is the set of faces of graph . Keywords: maximal planar graph, Tait coloring, Laplace-Kirchhoff matrix, spanning tree.
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