A Vertex-Weighted Tutte Symmetric Function, and Constructing Graphs with Equal Chromatic Symmetric Function

This paper has two main parts. First, we consider the Tutte symmetric function XB, a generalization of the chromatic symmetric function. We introduce a vertex-weighted version of XB and show that this function admits a deletion-contraction relation. We also demonstrate that the vertex-weighted XB admits spanning-tree and spanning-forest expansions generalizing those of the Tutte polynomial by connecting XB to other graph functions. Second, we give several methods for constructing nonisomorphic graphs with equal chromatic and Tutte symmetric functions, and use them to provide specific examples.

Integer points enumerator of hypergraphic polytopes

For a hypergraphic polytope there is a weighted quasisymmetric function which enumerates positive integer points in its normal fan and determines its f-polynomial. This quasisymmetric function invariant of hypergraphs extends the Stanley chromatic symmetric function of simple graphs. We consider a certain combinatorial Hopf algebra of hypergraphs and show that universal morphism to quasisymmetric functions coincides with this enumerator function. We calculate the f-polynomial of uniform hypergraphic polytopes.

A Counterexample to a Conjecture on Schur Positivity of Chromatic Symmetric Functions of trees

We show that no tree on twenty vertices with maximum degree ten has Schur positive chromatic symmetric function, thereby providing a counterexample to a conjecture of Dahlberg, She and van Willigenburg.