相关论文: Chromatic Polynomials, Potts Models and All That
First, I introduce quantum graph theory. I also discuss a known lower bound on the independence numbers and derive from it an upper bound on the chromatic numbers of quantum graphs. Then, I construct a family of quantum graphs that can be…
We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…
Chromatic polynomials are important objects in graph theory and statistical physics, but as a result of computational difficulties, their study is limited to graphs that are small, highly structured, or very sparse. We have devised and…
We study the partition function of Potts model in an external (magnetic) field, and its connections with the zero-field Potts model partition function. Using a deletion-contraction formulation for the partition function Z for this model, we…
While the ground-state problem for the random-field Ising model is polynomial, and can be solved using a number of well-known algorithms for maximum flow or graph cut, the analogue random-field Potts model corresponds to a multi-terminal…
Given a central integral arrangement, the reduction of the arrangement modulo positive integers $q$ gives rise to a subgroup arrangement in $(\mathbb{Z}/q\mathbb{Z})^\ell$. Kamiya-Takemura-Terao (2008) introduced the notion of…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
We present exact calculations of partition function $Z$ of the $q$-state Potts model with next-nearest-neighbor spin-spin couplings, both for the ferromagnetic and antiferromagnetic case, for arbitrary temperature, on $n$-vertex strip…
Let $G=(V,E)$ be a simple undirected graph with $n$ vertices then a set partition $\pi=\{V_1, ..., V_k\}$ of the vertex set of $G$ is a connected set partition if each subgraph $G[V_j]$ induced by the blocks $V_j$ of $\pi$ is connected for…
In this paper, we present some properties on chromatic polynomials of hypergraphs which do not hold for chromatic polynomials of graphs. We first show that chromatic polynomials of hypergraphs have all integers as their zeros and contain…
Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…
The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…
We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…
We study the chromatic symmetric function on graphs, and show that its kernel is spanned by the modular relations. We generalize this result to the chromatic quasisymmetric function on hypergraphic polytopes, a family of generalized…
Cographs--defined most simply as complete graphs with colored lines--both dualize and generalize ordinary graphs, and promise a comparably wide range of applications. This article introduces them by examples, catalogues, and elementary…
Motivated by the observation that the counting function of a certain base-3 colored partition contains the even perfect numbers as a subsequence, we begin by defining a sequence of polynomials in four variables and discuss their properties…
Sampling from the $q$-state ferromagnetic Potts model is a fundamental question in statistical physics, probability theory, and theoretical computer science. On general graphs, this problem may be computationally hard, and this hardness…
In this work, we generalize and utilize the linear relations of LLT polynomials introduced by Lee \cite{Lee}. By using the fact that the chromatic quasisymmetric functions and the unicellular LLT polynomials are related via plethystic…
We introduce the notion of colorful minors, which generalizes the classical concept of rooted minors in graphs. A $q$-colorful graph is defined as a pair $(G, \chi),$ where $G$ is a graph and $\chi$ assigns to each vertex a (possibly empty)…
The NP-complete problems Colouring and k-Colouring $(k\geq 3$) are well studied on $H$-free graphs, i.e., graphs that do not contain some fixed graph $H$ as an induced subgraph. We research to what extent the known polynomial-time…