|
|||||
 |
|
|
|
|
|
|
|
A few more
trees the chromatic symmetric function can distinguish
Jake Huryn and Sergei Chmutov
Vol. 13 (2020), No. 1, 109–116
|
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 -spiders, where normal spiders correspond to , and verifies the conjecture for . |
PDF Access Denied
We have not been able to recognize your IP address
18.226.187.24
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form. Or, visit our subscription page for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for USD 30.00:
Keywords
graph theory, combinatorics, chromatic symmetric function
|
Mathematical Subject Classification 2010
Primary: 05C05, 05C31, 05E05
|
Milestones
Received: 30 March 2019
Revised: 2 August 2019
Accepted: 4 November 2019
Published: 4 February 2020
Communicated by Joel Foisy
|
Authors |
| Jake Huryn | |
| The Ohio State University Columbus, OH United States |
|
| Sergei Chmutov | |
| The Ohio State University Columbus, OH United States |
|
