相关论文: Zero-free regions for multivariate Tutte polynomia…

We calculate the continuous accumulation set ${\cal B}_q(p,\ell)$ of zeros of the chromatic polynomial $P(G^{(p,\ell)}_m,q)$ in the limit $m \to \infty$, on a family of graphs $G^{(p,\ell)}_m$ defined such that $G^{(p,\ell)}_m$ is obtained…

The Tutte polynomial of a connected graph was originally defined by Tutte as a sum over all spanning trees of monomials depending on a fixed linear order on the set of edges. Tuttle proved that while these monomials do depend on the linear…

In his article [J. Comb. Theory Ser. B 16 (1974), 168-174], Tutte called two graphs $T$-equivalent (i.e., codichromatic) if they have the same Tutte polynomial and showed that graphs $G$ and $G'$ are $T$-equivalent if $G'$ is obtained from…

This article studies real roots of the flow polynomial $F(G,\lambda)$ of a bridgeless graph $G$. For any integer $k\ge 0$, let $\xi_k$ be the supremum in $(1,2]$ such that $F(G,\lambda)$ has no real roots in $(1,\xi_k)$ for all graphs $G$…

We associate two modules, the $G$-parking critical module and the toppling critical module, to an undirected connected graph $G$. The $G$-parking critical module and the toppling critical module are canonical modules (with suitable twists)…

The chromatic polynomial $P(G,x)$ of a graph $G$ of order $n$ can be expressed as $\sum\limits_{i=1}^n(-1)^{n-i}a_{i}x^i$, where $a_i$ is interpreted as the number of broken-cycle free spanning subgraphs of $G$ with exactly $i$ components.…

The Tutte polynomial is a fundamental invariant of graphs. In this article, we define and study a generalization of the Tutte polynomial for directed graphs, that we name B-polynomial. The B-polynomial has three variables, but when…

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…

Suppose $G$ is a simple graph with $n$ vertices, $m$ edges, and rank $r$. Let $\chi_G(t)=a_0t^n-a_1t^{n-1}+\cdots +(-1)^ra_rt^{n-r}$ be the chromatic polynomial of $G$. For $q,k\in \Bbb{Z}$ and $0\le k\le q+r+1$, we obtain a sharp two-side…

We introduce an arithmetic version of the multivariate Tutte polynomial, and (for representable arithmetic matroids) a quasi-polynomial that interpolates between the two. A generalized Fortuin-Kasteleyn representation with applications to…

The coloring problem is a well-research topic and its complexity is known for several classes of graphs. However, the question of its complexity remains open for the class of antiprismatic graphs, which are the complement of prismatic…

A hole in a graph $G$ is an induced cycle of length at least four, and a $k$-multihole in $G$ is a set of pairwise disjoint and nonadjacent holes. It is well known that if $G$ does not contain any holes then its chromatic number is equal to…

The $\sigma$-polynomial is given by $\sigma(G,x) = \sum_{i=\chi(G)}^{n} a_{i}(G)\, x^{i}$, where $a_{i}(G)$ is the number of partitions of the vertices of $G$ into $i$ nonempty independent sets. These polynomials are closely related to…

Given an infinite graph $\GI$ quasi-transitive and amenable with maximum degree $\D$, we show that reduced ground state degeneracy per site $W_r(\GI,q)$ of the q-state antiferromagnetic Potts model at zero temperature on $\GI$ is analytic…

A graph is h-perfect if its stable set polytope can be completely described by non-negativity, clique and odd-hole constraints. It is t-perfect if it furthermore has no clique of size 4. For every graph $G$ and every…

For a graph $G$, a $k$-coloring $c:V(G)\to \{1,2,\ldots, k\}$ is called distinguishing, if the only automorphism $f$ of $G$ with the property $c(v)=c(f(v))$ for every vertex $v\in G$ (color-preserving automorphism), is the identity. In this…

In this paper we prove a new zero-free region for the partition function of the hard-core model, that is, the independence polynomials of graphs with largest degree $\Delta$. This new domain contains the half disk $$D=\left\{ \lambda \in…

Many important enumerative invariants of a matroid can be obtained from its Tutte polynomial, and many more are determined by two stronger invariants, the $\mathcal{G}$-invariant and the configuration of the matroid. We show that the same…

In this paper, we study graphs whose matching polynomial have only integer zeros. A graph is matching integral if the zeros of its matching polynomial are all integers. We characterize all matching integral traceable graphs.. We show that…

We show that in an ordered matroid the partial derivative \partial^{p+q}t/\partialx^p\partialyq of the Tutte polynomial is p!q! times the generating function of activities of subsets with corank p and nullity q. More generally, this…