English

Resolving Stanley's $e$-positivity of claw-contractible-free graphs

Combinatorics 2020-05-21 v3

Abstract

In Stanley's seminal 1995 paper on the chromatic symmetric function, he stated that there was no known graph that was not contractible to the claw and whose chromatic symmetric function was not ee-positive, namely, not a positive linear combination of elementary symmetric functions. We resolve this by giving infinite families of graphs that are not contractible to the claw and whose chromatic symmetric functions are not ee-positive. Moreover, one such family is additionally claw-free, thus establishing that the ee-positivity of chromatic symmetric functions is in general not dependent on the existence of an induced claw or of a contraction to a claw.

Keywords

Cite

@article{arxiv.1703.05770,
  title  = {Resolving Stanley's $e$-positivity of claw-contractible-free graphs},
  author = {Samantha Dahlberg and Angele Foley and Stephanie van Willigenburg},
  journal= {arXiv preprint arXiv:1703.05770},
  year   = {2020}
}

Comments

Label corrected in Example 3.1, 28 pages, final version to appear in J. Eur. Math. Soc. (JEMS)