Answers are grounded in this paper and cite their sources.
In this paper, we extend the chromatic symmetric function X to a chromatic k-multisymmetric function Xk, defined for graphs equipped with a partition of their vertex set into k parts. We demonstrate that this new function retains the basic properties and basis expansions of X, and we give a method for systematically deriving new linear relationships for X from previous ones by passing them through Xk. In particular, we show how to take advantage of homogeneous sets of G (those S⊆V(G) such that each vertex of V(G)﹨S is either adjacent to all of S or is nonadjacent to all of S) to relate the chromatic symmetric function of G to those of simpler graphs. Furthermore, we show how extending this idea to homogeneous pairs S1⊔S2⊆V(G) generalizes the process used by Guay-Paquet to reduce the Stanley-Stembridge conjecture to unit interval graphs.
No takes yet. Share an insight, caveat, or question.
Crew et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: