A graph polynomial from chromatic symmetric functions

DOI10.1002/jgt.23060arXiv2110.15291OpenAlexW4388938474MaRDI QIDQ6199385

No author found.

Publication date: 23 February 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

chromatic polynomialalgebraic graph theorygraph polynomialsalgebraic combinatoricschromatic symmetric function

Mathematics Subject Classification ID

Graph polynomials (05C31) Symmetric functions and generalizations (05E05) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Chromatic classical symmetric functions
• Chromatic bases for symmetric functions
• A weighted graph polynomial from chromatic invariants of knots
• A categorification of the chromatic symmetric function
• The chromatic symmetric functions of trivially perfect graphs and cographs
• A symmetric function generalization of the chromatic polynomial of a graph
• Extended chromatic symmetric functions and equality of ribbon Schur functions
• A deletion-contraction relation for the chromatic symmetric function
• Chromatic symmetric functions via the group algebra of \(S_n\)
• Unit interval orders and the dot action on the cohomology of regular semisimple Hessenberg varieties
• Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions

This page was built for publication: A graph polynomial from chromatic symmetric functions