.png){kind=icon}
Return
Graphs missing a connected partition
.png){kind=icon}
PRE
AI
DOI：10.1016/j.aam.2026.103044.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We prove that a graph with a cut vertex whose deletion produces at least five connected components must be missing a connected partition of some type. We prove that this also holds if there are four connected components that each have at least two vertices. In particular, the chromatic symmetric function of such a graph cannot be e-positive. This brings us very close to the conjecture by Dahlberg, She, and van Willigenburg of non-e-positivity for all trees with a vertex of degree at least four. We also prove that spiders with four legs cannot have an e-positive chromatic symmetric function. (c) 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
Keywords:
Chromatic symmetric function
Connected partition
Cut vertex
e-positive
Graph partition
Stanley-Stembridge conjecture
Tree isomorphism conjecture
Journal
A
IF:
1.3
Papers:
61
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave
View more