A complete multipartite basis for the chromatic symmetric function
Abstract: In the vector space of symmetric functions, the elements of the basis of elementary symmetric functions are (up to a factor) the chromatic symmetric functions of disjoint unions of cliques. We consider their graph complements, the functions ${r_{\lambda}: \lambda \text{ an integer partition}}$ defined as chromatic symmetric functions of complete multipartite graphs. This basis was first introduced by Penaguiao [21]. We provide a combinatorial interpretation for the coefficients of the change-of-basis formula between the $r_{\lambda}$ and the monomial symmetric functions, and we show that the coefficients of the chromatic and Tutte symmetric functions of a graph $G$ when expanded in the $r$-basis enumerate certain intersections of partitions of $V(G)$ into stable sets.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.