A few more trees the chromatic symmetric function can distinguish

From MaRDI portal
Publication:2299412

DOI10.2140/INVOLVE.2020.13.109zbMATH Open1431.05041arXiv1901.04034OpenAlexW3101089388MaRDI QIDQ2299412FDOQ2299412


Authors: Jake Huryn, S. Chmutov Edit this on Wikidata


Publication date: 21 February 2020

Published in: Involve (Search for Journal in Brave)

Abstract: A well-known open problem in graph theory asks whether Stanley's chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two non-isomorphic trees. Previous work has proven the conjecture for a class of trees called spiders. This paper generalizes the class of spiders to n-spiders, where normal spiders correspond to n=1, and verifies the conjecture for n=2.


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




Recommendations




Cites Work


Cited In (16)





This page was built for publication: A few more trees the chromatic symmetric function can distinguish

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299412)