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

Abstract

Consider a connected pseudograph H such that each edge is associated with weight xe, xe ∈ F3; T(H) is the set of spanning trees of graph H. Assume that s(H; x)=ΣT∈T(H) Πe∈ E(T) xe. Let G be a maximal planar graph (arbitrary planar triangulation) such that each face F is assigned the value α(F)= 1 ∈ F3. Then we can associate each edge with xe=α(F'e)+α(F''e), where F'e and F''e are the faces containing edge e. Let us define the value wG( x) as (s(G/W*( x); x)3)/(-3)(|V(G/W*( x))| - 1)/2; here (x3) is the Legendre symbol, G/W is the graph with the contracted set of vertices W, while W*( x) is a set of vertices W, W ⊂eq V(G), with minimal cardinality such that s(G/W; x) differs from zero. In the following, we prove that the number of Tait colorings for graph G equals the tripled sum wG( x(α)) with respect to all possible vectors α ∈ \-1, 1\ F(G) such that G/W*( x(α)) has an odd number of vertices, where F(G) is the set of faces of graph G. Keywords: maximal planar graph, Tait coloring, Laplace-Kirchhoff matrix, spanning tree.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…