The e-positivity of two families of (claw, 2K2)-free graphs
Abstract
Motivated by Stanley's conjecture about the e-positivity of claw-free incomparability graphs, Hamel and her collaborators studied the e-positivity of (claw, H)-free graphs, where H is a four-vertex graph. In this paper we establish the e-positivity of generalized pyramid graphs and 2K2-free unit interval graphs, which are two important families of (claw, 2K2)-free graphs. Hence we affirmatively solve one problem proposed by Hamel, Ho\`ang and Tuero, and another problem considered by Foley, Ho\`ang and Merkel.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.