Classes of graphs with \(e\)-positive chromatic symmetric function (Q2325752)

Summary: \textit{R. P. Stanley} and \textit{J. R. Stembridge} [J. Comb. Theory, Ser. A 62, No. 2, 261--279 (1993; Zbl 0772.05097)] conjectured that the chromatic symmetric functions of claw-free co-comparability (also called incomparability) graphs were \(e\)-positive. The quest for the proof of this conjecture has led to an examination of other, related graph classes. \textit{M. Guay-Paquet} [``A modular relation for the chromatic symmetric functions of (3+1) free posets'', Preprint, \url{arXiv:1306.2400}] proved that if unit interval graphs are \(e\)-positive, that implies claw-free incomparability graphs are as well. Inspired by this approach, we consider a related case and prove that unit interval graphs whose complement is also a unit interval graph are \(e\)-positive. We introduce the concept of strongly \(e\)-positive to denote a graph whose induced subgraphs are all \(e\)-positive, and conjecture that a graph is strongly \(e\)-positive if and only if it is (claw, net)-free.