arXiv:2411.13411 [math.CO]AbstractReferencesReviewsResources
On Calculating the Chromatic Symmetric Function
Nima Amoei Mobaraki, Yasaman Gerivani, Sina Ghasemi Nezhad
Published 2024-11-20Version 1
This paper investigates methods for calculating the chromatic symmetric function (CSF) of a graph in chromatic-bases and the $m_\lambda$-basis. Our key contributions include a novel approach for calculating the CSF in chromatic-bases constructed from forests and an efficient method for determining the CSF in the $m_\lambda$-basis. As applications, we present combinatorial proofs for two known theorems that were originally established using algebraic techniques. Additionally, we demonstrate that an algorithm introduced by Gonzalez, Orellana, and Tomba arises as a special case of our proposed method.
Comments: arXiv admin note: text overlap with arXiv:2404.06002 by other authors
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2311.08020 [math.CO] (Published 2023-11-14)
A signed $e$-expansion of the chromatic symmetric function and some new $e$-positive graphs
arXiv:2505.06486 [math.CO] (Published 2025-05-10)
The Chromatic Symmetric Function for Unicyclic Graphs
arXiv:2405.17649 [math.CO] (Published 2024-05-27)
The $e$-positivity of the chromatic symmetric function for twinned paths and cycles
Esther Banaian et al.