Translator Disclaimer
2020 A few more trees the chromatic symmetric function can distinguish
Jake Huryn, Sergei Chmutov
Involve 13(1): 109-116 (2020). DOI: 10.2140/involve.2020.13.109

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 nonisomorphic 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 .

Citation

Download Citation

Jake Huryn. Sergei Chmutov. "A few more trees the chromatic symmetric function can distinguish." Involve 13 (1) 109 - 116, 2020. https://doi.org/10.2140/involve.2020.13.109

Information

Received: 30 March 2019; Revised: 2 August 2019; Accepted: 4 November 2019; Published: 2020
First available in Project Euclid: 20 March 2020

zbMATH: 07172115
MathSciNet: MR4059945
Digital Object Identifier: 10.2140/involve.2020.13.109

Subjects:
Primary: 05C05, 05C31, 05E05

Rights: Copyright © 2020 Mathematical Sciences Publishers

JOURNAL ARTICLE
8 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.13 • No. 1 • 2020
MSP
Back to Top