On the \(e\)-positivity of \((claw, 2K_2)\)-free graphs (Q2034064): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.37236/9910 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3176753413 / rank | |||
Normal rank |
Revision as of 22:05, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the \(e\)-positivity of \((claw, 2K_2)\)-free graphs |
scientific article |
Statements
On the \(e\)-positivity of \((claw, 2K_2)\)-free graphs (English)
0 references
21 June 2021
0 references
Summary: Motivated by Stanley and Stembridge's conjecture [\textit{R. P. Stanley} and \textit{J. R. Stembridge}, J. Comb. Theory, Ser. A 62, No. 2, 261--279 (1993; Zbl 0772.05097)] about the \(e\)-positivity of claw-free incomparability graphs, Hamel and her collaborators [\textit{A. M. Hamel} et al., Graphs Comb. 35, No. 4, 815--825 (2019; Zbl 1416.05105)] 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 \(2K_2\)-free unit interval graphs, which are two important families of \((claw, 2K_2)\)-free graphs. Hence we affirmatively solve one problem proposed by Hamel et al. [loc. cit.], and another problem considered by \textit{A. M. Foley} et al. [Electron. J. Comb. 26, No. 3, Research Paper P3.51, 20 p. (2019; Zbl 1420.05177)].
0 references
chromatic symmetric function
0 references
claw-free graphs
0 references