In this abstract, we construct explicitly, for every k, pairs of non-isomorphic trees with the same restricted U-polynomial; by this we mean that the polynomials agree on terms with degree at most k. The construction is done purely in algebraic terms, after introducing and studying a generalization of the U-polynomial to rooted graphs.
- chromatic symmetric function
- Stanley's conjecture
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics