Chromatic symmetric functions and H-free graphs
classification
🧮 math.CO
keywords
graphsclawsymmetricchromaticclaw-freefunctionsh-freequestion
read the original abstract
Two celebrated conjectures in chromatic symmetric function theory concern the positivity chromatics symmetric functions of claw-free graphs. Here we extend the claw-free idea to general graphs and consider the e-positivity question for H-free graphs where H = {claw, F} and H={claw, F, co-F}, where F is a four-vertex graph. We settle the question for all cases except H={claw, co-diamond}, and we provide some partial results in that case.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.