English
Related papers

Related papers: Evaluations of topological Tutte polynomials

200 papers

We study the space ${\mathcal X}^{d}(G)$ of pictures of a graph $G$ in complex projective $d$-space. The main result is that the homology groups (with integer coefficients) of ${\mathcal X}^{d}(G)$ are completely determined by the Tutte…

Combinatorics · Mathematics 2007-05-23 Jeremy L. Martin

We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$…

Mathematical Physics · Physics 2011-08-19 Robert Shrock , Yan Xu

We introduce the notions of arithmetic colorings and arithmetic flows over a graph with labelled edges, which generalize the notions of colorings and flows over a graph. We show that the corresponding arithmetic chromatic polynomial and…

Combinatorics · Mathematics 2011-08-30 Michele D'Adderio , Luca Moci

Let $G=(V,E)$ be a finite, simple graph. We consider for each oriented graph $G_{\cal O}$ associated to an orientation ${\cal O}$ of the edges of $G$, the toric ideal $P_{G_{\cal O}}$. In this paper we study those graphs with the property…

Commutative Algebra · Mathematics 2013-01-01 I. Gitler , E. Reyes , J. A. Vega

In \cite{4} Kauffman and Vogel constructed a rigid vertex regular isotopy invariant for unoriented four-valent graphs embedded in three dimensional space. It assigns to each embedded graph $G$ a polynomial, denoted $[G]$, in three…

Geometric Topology · Mathematics 2007-05-23 Rui Pedro Carpentier

Recently, Chmutov introduced the partial duality of ribbon graphs, which can be regarded as a generalization of the classical Euler-Poincar\'e duality. The partial-dual genus polynomial $^\partial\varepsilon_G(z)$ is an enumeration of the…

Combinatorics · Mathematics 2025-09-03 Zhiyun Cheng

This paper is based on a series of talks given at the Patejdlovka Enumeration Workshop held in the Czech Republic in November 2007. The topics covered are as follows. The graph polynomial, Tutte-Grothendieck invariants, an overview of…

Combinatorics · Mathematics 2008-07-01 Andrew Goodall

A graph $G$ is said to be $p$-periodic, if the automorphism group $Aut(G)$ contains an element of order $p$ which preserves no edges. In this paper, we investigate the behavior of graph polynomials (Negmai and Tutte) with respect to graph…

Combinatorics · Mathematics 2011-04-01 Nafaa Chbili

Splitting invariants describe how a plane curve "splits" by the pull-back under a Galois cover over the projective plane whose branch locus contains no component of the plane curve. They enable us to distinguish the embedded topology of…

Algebraic Geometry · Mathematics 2026-04-29 Taketo Shirane

We present exact calculations of the $q$-state Potts model partition functions and the equivalent Tutte polynomials for chain graphs comprised of $m$ repeated hammock subgraphs $H_{e_1,...,e_r}$ connected with line graphs of length $e_g$…

Statistical Mechanics · Physics 2025-06-10 Yue Chen , Robert Shrock

For any graph $G$, the chromatic polynomial of $G$ is the function $P(G,m)$ which counts the number of proper $m$-colorings of $G$ for each positive integer $m$. The DP color function $P_{DP}(G,m)$ of $G$, introduced by Kaul and Mudrock in…

Combinatorics · Mathematics 2021-11-30 Fengming Dong , Yan Yang

It is well known that the 2-variable Tutte polynomials contain chromatic polynomial and flow polynomial of graphs, i.e. the cases of $y=0$ and $x=0$. In 2013, K\'{a}lm\'{a}n introduced the interior and exterior polynomials which generalized…

Combinatorics · Mathematics 2026-05-26 Tianlong Ma , Xiaxia Guan , Xian'an Jin

Identities obtained by elementary finite Fourier analysis are used to derive a variety of evaluations of the Tutte polynomial of a graph G at certain points (a,b) where (a-1)(b-1) equals 2 or 4. These evaluations are expressed in terms of…

Combinatorics · Mathematics 2007-09-20 Andrew J. Goodall

The reconstruction conjecture has remained open for simple undirected graphs since it was suggested in 1941 by Kelly and Ulam. In an attempt to prove the conjecture, many graph invariants have been shown to be reconstructible from the…

Combinatorics · Mathematics 2012-10-15 T. Kotek

We consider two operations on an edge of an embedded graph (or equivalently a ribbon graph): giving a half-twist to the edge and taking the partial dual with respect to the edge. These two operations give rise to an action of S_3^{|E(G)|},…

Combinatorics · Mathematics 2012-02-28 Joanna A. Ellis-Monaghan , Iain Moffatt

Polynomials on stranded graphs are higher dimensional generalization of Tutte and Bollob\'as-Riordan polynomials [Math. Ann. 323 (2002), 81-96]. Here, we deepen the analysis of the polynomial invariant defined on rank 3 weakly-colored…

Combinatorics · Mathematics 2016-03-24 Remi Cocou Avohou

We construct a new polynomial invariant of maps (graphs embedded in a compact surface, orientable or non-orientable), which contains as specializations the Krushkal polynomial, the Bollob\'as--Riordan polynomial, the Las Vergnas polynomial,…

Combinatorics · Mathematics 2018-04-05 Andrew Goodall , Bart Litjens , Guus Regts , Lluís Vena

For all integers $4 \leq r \leq d$, we show that there exists a finite simple graph $G= G_{r,d}$ with toric ideal $I_G \subset R$ such that $R/I_G$ has (Castelnuovo-Mumford) regularity $r$ and $h$-polynomial of degree $d$. To achieve this…

Commutative Algebra · Mathematics 2020-03-17 Giuseppe Favacchio , Graham Keiper , Adam Van Tuyl

The Tutte polynomial is a significant invariant of graphs and matroids. It is well-known that it has three equivalent definitions: bases expansion, rank generating function, and deletion-contraction formula. The polymatroid Tutte polynomial…

Combinatorics · Mathematics 2025-10-14 Xiaxia Guan , Xian'an Jin , Weiling Yang

We study Dohmen--P\"onitz--Tittmann's bivariate chromatic polynomial $c_\Gamma(k,l)$ which counts all $(k+l)$-colorings of a graph $\Gamma$ such that adjacent vertices get different colors if they are $\le k$. Our first contribution is an…

Combinatorics · Mathematics 2016-05-10 Matthias Beck , Mela Hardin