arXiv:1910.11859 [math.CO]AbstractReferencesReviewsResources
A Deletion-Contraction Relation for the Chromatic Symmetric Function
Published 2019-10-25Version 1
We extend the definition of the chromatic symmetric function $X_G$ to include graphs $G$ with a vertex-weight function $w : V(G) \rightarrow \mathbb{N}$. We show how this provides the chromatic symmetric function with a natural deletion-contraction relation analogous to that of the chromatic polynomial. Using this relation we derive new properties of the chromatic symmetric function, and we give alternate proofs of many fundamental properties of $X_G$.
Related articles: Most relevant | Search more
arXiv:1904.01262 [math.CO] (Published 2019-04-02)
Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function
arXiv:1604.03063 [math.CO] (Published 2016-04-11)
A note on non-broken-circuit sets and the chromatic polynomial
A quasisymmetric function generalization of the chromatic symmetric function