Related papers: Chromatic polynomial and the $\mathfrak{so}$ weigh…
These notes are designed to offer some (perhaps new) codicils to related work, a list of problems and conjectures seeking (preferably) combinatorial proofs. The main items are Eulerian polynomials and hook/contents of Young diagram, mostly…
We study a very large family of graphs, the members of which comprise disjoint paths of cliques with extremal cliques identified. This broad characterisation naturally generalises those of various smaller families of graphs having…
In this article we consider certain well-known polynomials associated with graphs including the independence polynomial and the chromatic polynomial. These polynomials count certain objects in graphs: independent sets in the case of the…
In this paper, two recursion formulae of chromatic polynomial of a maximal planar graph G are obtained. Moreover, the application of these formulaes to the proof of Four-Color Conjecture is investigated. By using these formulae, the proof…
In [J. Combin. Theory Ser. B 161 (2023), 109--119], the authors showed that the list-color function $P_l(G,k)$ of any simple graph $G$ of size $m$ coincides with its chromatic polynomial $P(G,k)$ for all integers $k\ge m-1$. In this…
Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…
The bivariate chromatic polynomial $\chi_G(x,y)$ of a graph $G = (V, E)$, introduced by Dohmen-P\"{o}nitz-Tittmann (2003), counts all $x$-colorings of $G$ such that adjacent vertices get different colors if they are $\le y$. We extend this…
We study two weighted graph coloring problems, 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 color. We…
An $(m,n)$-mixed graph generalizes the notions of oriented graphs and edge-coloured graphs to a graph object with $m$ arc types and $n$ edge types. A simple colouring of such a graph is a non-trivial homomorphism to a reflexive target. We…
Ideas of Rozansky and Witten, as developed by Kapranov, show that a complex symplectic manifold X gives rise to Vassiliev weight systems. In this paper we study these weight systems by using D(X), the derived category of coherent sheaves on…
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…
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying p_S(x+y)=\sum_{T\uplus U=S}p_T(x)p_U(y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any…
Recently, we have witnessed tremendous applications of algebraic intersection theory to branches of mathematics, that previously seemed very distant. In this article we review some of them. Our aim is to provide a unified approach to the…
The orbital bivariate chromatic polynomial, introduced in this article, counts the number of ways to color the vertices of a graph with $\lambda$ colors such that adjacent vertices either receive distinct colors from a set of $\lambda$…
The generalized composition graph is used by Cardoso and some researchers for factorization of the adjacency spectrum and Laplacian of a simple graph. Because the generalized composition graph is an example of a set-theoretic linear operad,…
A color Lie algebra is a generalization of a Lie (super)algebra by an Abelian group $\Gamma$. The underlying vector space and defining relations of the algebra are graded by $\Gamma$, and the color Lie algebra admits graded Casimir…
We discuss polynomials orthogonal with respect to a semi-classical generalised higher order Freud weight \[\omega(x;t,\lambda)=|x|^{2\lambda+1}\exp\left(tx^2-x^{2m}\right),\qquad x\in\mathbb{R},\] with parameters $\lambda > -1$,…
This paper describes an improvement in the upper bound for the magnitude of a coefficient of a term in the chromatic polynomial of a general graph. If $a_r$ is the coefficient of the $q^r$ term in the chromatic polynomial $P(G,q)$, where…
This paper describes how many known graph polynomials arise from the coefficients of chromatic symmetric function expansions in different bases, and studies a new polynomial arising by expanding over a basis given by chromatic symmetric…
Let $P(G,\lambda)$ denote the number of proper vertex colorings of $G$ with $\lambda$ colors. The chromatic polynomial $P(C_n,\lambda)$ for the cycle graph $C_n$ is well-known as $$P(C_n,\lambda) = (\lambda-1)^n+(-1)^n(\lambda-1)$$ for all…