A note on distinguishing trees with the chromatic symmetric function

DOI10.1016/j.disc.2021.112682zbMath1479.05351arXiv2106.04417OpenAlexW3205746604MaRDI QIDQ2666579

Logan Crew

Publication date: 23 November 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.04417

zbMATH Keywords

graph polynomialsalgebraic combinatoricschromatic symmetric functionsubtree polynomialtree isomorphism conjecture

Mathematics Subject Classification ID

Graph polynomials (05C31) Symmetric functions and generalizations (05E05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (1)

A horizontal-strip LLT polynomial is determined by its weighted graph

Cites Work

• Unnamed Item
• A weighted graph polynomial from chromatic invariants of knots
• Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
• A categorification of the chromatic symmetric function
• A symmetric function generalization of the chromatic polynomial of a graph
• A deletion-contraction relation for the chromatic symmetric function
• A few more trees the chromatic symmetric function can distinguish
• Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars
• On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem
• On distinguishing trees by their chromatic symmetric functions
• Tutte polynomials for trees
• On an Algorithm for Comparing the Chromatic Symmetric Functions of Trees
• Unit interval orders and the dot action on the cohomology of regular semisimple Hessenberg varieties

This page was built for publication: A note on distinguishing trees with the chromatic symmetric function