Related papers: On Calculating the Chromatic Symmetric Function

Stanley defined the chromatic symmetric function of a graph, and Shareshian and Wachs introduced a refinement, namely the chromatic quasisymmetric function of a labeled graph. In this paper, we define the chromatic quasisymmetric function…

Let $\mathfrak g$ be a Borcherds algebra with the associated graph $G$. We prove that the chromatic symmetric function of $G$ can be recovered from the Weyl denominator identity of $\mathfrak g$ and this gives a Lie theoretic proof of…

This paper has two main parts. First, we consider the Tutte symmetric function $XB$, a generalization of the chromatic symmetric function. We introduce a vertex-weighted version of $XB$ and show that this function admits a…

The chromatic symmetric function $X_H$ of a hypergraph $H$ is the generating function for all colorings of $H$ so that no edge is monochromatic. When $H$ is an ordinary graph, it is known that $X_H$ is positive in the fundamental…

For an indifference graph $G$ we define a symmetric function of increasing spanning forests of $G$. We prove that this symmetric function satisfies certain linear relations, which are also satisfied by the chromatic quasisymmetric function…

The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base of a graph, which originated in work related to ergodic…

We show that the discrete versions of the systolic inequality that estimate the number of vertices of a simplicial complex from below have substantial applications to graphs, the one-dimensional simplicial complexes. Almost directly they…

Shareshian-Wachs, Brosnan-Chow, and Guay-Pacquet [Adv. Math. ${\bf 295}$ (2016), ${\bf 329}$ (2018), arXiv:1601.05498] realized the chromatic (quasi-)symmetric function of a unit interval graph in terms of Hessenberg varieties. Here we…

Stanley associated with a graph G a symmetric function X_G which reduces to G's chromatic polynomial under a certain specialization of variables. He then proved various theorems generalizing results about the chromatic polynomial, as well…

There are many concepts of signed graph coloring which are defined by assigning colors to the vertices of the graphs. These concepts usually differ in the number of self-inverse colors used. We introduce a unifying concept for this kind of…

Plethysm is a fundamental operation in symmetric function theory, derived directly from its connection with representation theory. However, it does not admit a simple combinatorial interpretation, and finding coefficients of Schur function…

Let $\mathcal{C} = \{c_1,c_2, c_3, \ldots,c_k\}$ be a certain type of proper $k$-colouring of a given graph $G$ and $\theta(c_i)$ denote the number of times a particular colour $c_i$ is assigned to the vertices of $G$. Then, the 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…

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…

The vertex coloring problem to find chromatic numbers is known to be unsolvable in polynomial time. Although various algorithms have been proposed to efficiently compute chromatic numbers, they tend to take an enormous amount of time for…

The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the…

The chromatic symmetric $X_G$ function is a symmetric function generalization of the chromatic polynomial of a graph, introduced by Stanley (1995). Stanley gave an expansion formula for $X_G$ in terms of the power sum symmetric functions…

Let $P$ be a poset, $inc(P)$ its incomparability graph, and $X_{inc(P)}$ the corresponding chromatic symmetric function, as defined by Stanley in {\em Adv. Math.}, {\bf 111} (1995) pp.~166--194. Certain conditions on $P$ imply that the…

Tatsuyuki Hikita recently proved the Stanley--Stembridge conjecture using probabilistic methods, showing that the chromatic symmetric functions of unit interval graphs are $e$-positive. Finding a combinatorial interpretation for these…

Motivated by the study of Macdonald polynomials, J. Haglund and A. Wilson introduced a nonsymmetric polynomial analogue of the chromatic quasisymmetric function called the \emph{chromatic nonsymmetric polynomial} of a Dyck graph. We give a…