|
|
A321979
|
|
Number of e-positive simple labeled graphs on n vertices.
|
|
11
|
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
A stable partition of a graph is a set partition of the vertices where no edge has both ends in the same block. The chromatic symmetric function is given by X_G = Sum_p m(t(p)) where the sum is over all stable partitions of G, t(p) is the integer partition whose parts are the block-sizes of p, and m is augmented monomial symmetric functions (see A321895). A graph is e-positive if, in the expansion of its chromatic symmetric function in terms of elementary symmetric functions, all coefficients are nonnegative.
|
|
LINKS
|
|
|
EXAMPLE
|
The 4 non-e-positive simple labeled graphs on 4 vertices are:
{{1,2},{1,3},{1,4}}
{{1,2},{2,3},{2,4}}
{{1,3},{2,3},{3,4}}
{{1,4},{2,4},{3,4}}
|
|
CROSSREFS
|
Cf. A000569, A006125, A229048, A240936, A277203, A321895, A321911, A321918, A321914, A321931, A321980, A321981, A321982.
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|