Related papers: Chromatic classical symmetric functions
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$.…
After deriving inequalities on coefficients arising in the expansion of a Schur $P$-function in terms of Schur functions we give criteria for when such expansions are multiplicity free. From here we study the multiplicity of an irreducible…
We discuss three distinct topics of independent interest; one in enumerative combinatorics, one in symmetric function theory, and one in algebraic geometry. The topic in enumerative combinatorics concerns a q-analog of a generalization of…
Steingrimsson (2001) showed that the chromatic polynomial of a graph is the Hilbert function of a relative Stanley-Reisner ideal. We approach this result from the point of view of Ehrhart theory and give a sufficient criterion for when the…
We associate to each synchronous game an algebra whose representations determine if the game has a perfect deterministic strategy, perfect quantum strategy or one of several other perfect strategies. when applied to the graph coloring game,…
For a natural unit interval order $P$, we describe proper colorings of the incomparability graph of $P$ in the language of heaps. We also introduce a combinatorial operation, called a \emph{local flip}, on the heaps. This operation defines…
We give a closed formula for Lovasz theta number of the powers of cycle graphs and of their complements, the circular complete graphs. As a consequence, we establish that the circular chromatic number of a circular perfect graph is…
It is consistent that for every monotonically increasing function f:omega->omega there is a graph with size and chromatic number aleph_1 in which every n-chromatic subgraph has at least f(n) elements (n >= 3). This solves a $250 problem of…
We introduce a notion of color-criticality in the context of chromatic-choosability. We define a graph $G$ to be strong $k$-chromatic-choosable if $\chi(G) = k$ and every $(k-1)$-assignment for which $G$ is not list-colorable has the…
We introduce joins of signed graphs and explore the chromatic number of the all-positive and all-negative joins. We prove an analogue to the theorem that the chromatic number of the join of two graphs equals the sum of their chromatic…
A graph $H$ is common if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is asymptotically minimised by the random colouring. We prove that, given $k,r>0$, there exists a $k$-connected common…
With the goal of providing the foundations for a rigorous study of modules of bicomplex holomorphic functions, we develop a general theory of functional analysis with bicomplex scalars. Even though the basic properties of bicomplex number…
We expand the chromatic symmetric functions for Dyck paths of bounce number three in the elementary symmetric function basis using a combinatorial interpretation of the inverse of the Kostka matrix studied in E\u{g}ecio\u{g}lu-Remmel…
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…
It is proved that harmonic functions are characterized by harmonicity of their spherical means, for which purpose the iterated spherical means are used. The similar characterization of solutions to the modified Helmholtz equation…
In this article we show how to compute the chromatic quasisymmetric function of indifference graphs from the modular law introduced by Guay-Paquet. We provide an algorithm which works for any function that satisfies this law, such as…
We consider the problem of determining when the difference of two ribbon Schur functions is a single Schur function. We fully classify the five infinite families of pairs of ribbon Schur functions whose difference is a single Schur function…
Symmetric functions provide one of the most efficient tools for combinatorial enumeration, in the context of objects that may be acted upon by permutations. Only assuming a basic knowledge of linear algebra, we introduce and describe the…
Motivated by the notion of nice graphs, we introduce the concept of strongly nice property, which can be used to study the Schur positivity of symmetric functions. We show that a graph and all its induced subgraphs are strongly nice if and…
We verify that a certain functor $D\colon\text{Sp}^\Sigma(\text{Ch}^+)\to\text{Ch}$ is symmetric monoidal. This functor is used elsewhere in developing the model category theory of symmetric spectra and of chain complexes graded over…