A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We prove that the chromatic symmetric function of any $n$-vertex tree containing a vertex of degree $d\geqslant \log _2n +1$ is not $e$-positive, that is, not a positive linear combination of elementary symmetric functions. Generalizing this, we also prove that the chromatic symmetric function of any $n$-vertex connected graph containing a cut vertex whose deletion disconnects the graph into $d\geqslant\log _2n +1$ connected components is not $e$-positive. Furthermore we prove that anydoi:10.37236/8930 fatcat:h5svlkipine3thokdfn2qbks2u