A complete multipartite basis for the chromatic symmetric function
From MaRDI portal
Publication:5013569
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 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 and the monomial symmetric functions, and we show that the coefficients of the chromatic and Tutte symmetric functions of a graph when expanded in the -basis enumerate certain intersections of partitions of into stable sets.
Recommendations
Cites work
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 739282 (Why is no real title available?)
- A deletion-contraction relation for the chromatic symmetric function
- A graded representation model for Macdonald's polynomials.
- A new class of symmetric functions
- A proof of the 4-variable Catalan polynomial of the delta conjecture
- A proof of the delta conjecture when \(q=0\)
- A symmetric function generalization of the chromatic polynomial of a graph
- A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function
- A weighted graph polynomial from chromatic invariants of knots
- Chromatic classical symmetric functions
- Classes of graphs with \(e\)-positive chromatic symmetric function
- Extended chromatic symmetric functions and equality of ribbon Schur functions
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
- Graphs with equal chromatic symmetric functions
- Hilbert schemes, polygraphs and the Macdonald positivity conjecture
- Lollipop and lariat symmetric functions
- On $e$-Positivity and $e$-Unimodality of Chromatic Quasi-symmetric Functions
- On an algorithm for comparing the chromatic symmetric functions of trees
- On the smallest trees with the same restricted \(U\)-polynomial and the rooted \(U\)-polynomial
- On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem
- Schur and \(e\)-positivity of trees and cut vertices
- The chromatic symmetric functions of trivially perfect graphs and cographs
- The delta conjecture
- The kernel of chromatic quasisymmetric functions on graphs and hypergraphic polytopes
This page was built for publication: A complete multipartite basis for the chromatic symmetric function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013569)