Abstract

We give a proof of the Stanley-Stembridge conjecture on chromatic symmetric functions for the class of all unit interval graphs with independence number 3. That is, we show that the chromatic symmetric function of the incomparability graph of a unit interval order in which the length of a chain is at most 3 is positively expanded as a linear sum of elementary symmetric functions.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call