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

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

Publication Details

Journal
ArXiv.org
Published
2025-10-11
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

ArXiv.org
Advanced Graph Theory Research
article

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

article en

Abstract

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

ArXiv.org
Openalex Percentile: Top 42%
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.