The e-positivity of two classes of cycle-chord graphs

David G.L. Wang, Monica M.Y. Wang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

We prove Gebhard and Sagan’s (e)-positivity of the line graphs of tadpoles in noncommuting variables. This implies the e-positivity of these line graphs. We then extend this (e)-positivity result to that of certain cycle-chord graphs and derive the bivariate generating function of all cycle-chord graphs.

Original languageEnglish
Pages (from-to)495-514
Number of pages20
JournalJournal of Algebraic Combinatorics
Volume57
Issue number2
DOIs
Publication statusPublished - Mar 2023

Keywords

  • Chromatic symmetric function
  • Stanley and Stembridge’s 3+1 conjecture
  • Symmetric functions in noncommuting variables
  • e-positivity

Fingerprint

Dive into the research topics of 'The e-positivity of two classes of cycle-chord graphs'. Together they form a unique fingerprint.

Cite this

Wang, D. G. L., & Wang, M. M. Y. (2023). The e-positivity of two classes of cycle-chord graphs. Journal of Algebraic Combinatorics, 57(2), 495-514. https://doi.org/10.1007/s10801-022-01175-6