A rooted variant of Stanley's chromatic symmetric function
Nicholas A. Loehr, Gregory S. Warrington

TL;DR
This paper introduces a rooted variant of Stanley's chromatic symmetric function, proves its irreducibility and distinguishes rooted trees, and provides combinatorial interpretations of related polynomials.
Contribution
It extends Stanley's chromatic symmetric function to rooted graphs, proves irreducibility for large N, confirms a rooted version of Stanley's conjecture, and interprets pointed chromatic functions combinatorially.
Findings
Rooted chromatic polynomials are irreducible for large N.
Rooted trees are uniquely identified by their rooted chromatic polynomials.
A specialized one-variable polynomial distinguishes rooted trees.
Abstract
Richard Stanley defined the chromatic symmetric function of a graph and asked whether there are non-isomorphic trees and with . We study variants of the chromatic symmetric function for rooted graphs, where we require the root vertex to either use or avoid a specified color. We present combinatorial identities and recursions satisfied by these rooted chromatic polynomials, explain their relation to pointed chromatic functions and rooted -polynomials, and prove three main theorems. First, for all non-empty connected graphs , Stanley's polynomial is irreducible in for all large enough . The same result holds for our rooted variant where the root node must avoid a specified color. We prove irreducibility by a novel combinatorial application of Eisenstein's Criterion. Second, we prove the rooted version…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Graph theory and applications · Topological and Geometric Data Analysis
