Graphs with equal chromatic symmetric functions
From MaRDI portal
Abstract: Stanley [9] introduced the chromatic symmetric function associated to a simple graph as a generalization of the chromatic polynomial of . In this paper we present a novel technique to write as a linear combination of chromatic symmetric functions of smaller graphs. We use this technique to give a sufficient condition for two graphs to have the same chromatic symmetric function. We then construct an infinite family of pairs of unicyclic graphs with the same chromatic symmetric function, answering the question posed by Martin, Morin, and Wagner [7] of whether such a pair exists. Finally, we approach the problem of whether it is possible to determine a tree from its chromatic symmetric function. Working towards an answer to this question, we give a classification theorem for single-centroid trees in terms of data closely related to its chromatic symmetric function.
Recommendations
- scientific article; zbMATH DE number 4087686
- The chromatic symmetric functions of trivially perfect graphs and cographs
- Chromatic symmetric functions and \(H\)-free graphs
- A symmetric function generalization of the chromatic polynomial of a graph
- Chromatic symmetric function of graphs from Borcherds algebras
- scientific article; zbMATH DE number 5073889
- Classes of graphs with \(e\)-positive chromatic symmetric function
- A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function
- scientific article; zbMATH DE number 4089574
Cites work
- A chromatic symmetric function in noncommuting variables
- A symmetric function generalization of the chromatic polynomial of a graph
- Graph theory
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- On distinguishing trees by their chromatic symmetric functions
Cited in
(57)- A categorification of the chromatic symmetric function
- Order quasisymmetric functions distinguish rooted trees
- The chromatic symmetric functions of trivially perfect graphs and cographs
- Extended chromatic symmetric functions and equality of ribbon Schur functions
- Chromatic posets
- Modular relations of the Tutte symmetric function
- The twinning operation on graphs does not always preserve e-positivity
- The \(e\)-positivity and Schur positivity of some spiders and broom trees
- On the \(e\)-positivity of trees and spiders
- \(H\)-chromatic symmetric functions
- A deletion-contraction relation for the chromatic symmetric function
- Chromatic symmetric functions from the modular law
- Chromatic symmetric functions in noncommuting variables revisited
- Melting lollipop chromatic quasisymmetric functions and Schur expansion of unicellular LLT polynomials
- Schur and \(e\)-positivity of trees and cut vertices
- Classes of graphs with \(e\)-positive chromatic symmetric function
- Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars
- On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem
- Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
- On distinguishing trees by their chromatic symmetric functions
- The kernel of chromatic quasisymmetric functions on graphs and nestohedra
- Spiders and their kin: an investigation of Stanley's chromatic symmetric function for spiders and related graphs
- A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function
- A note on distinguishing trees with the chromatic symmetric function
- The \(e\)-positivity of two classes of cycle-chord graphs
- Combinatorial Hopf algebras of simplicial complexes.
- Lollipop and lariat symmetric functions
- Bijective proofs of proper coloring theorems
- A complete multipartite basis for the chromatic symmetric function
- The connected partition lattice of a graph and the reconstruction conjecture
- On an algorithm for comparing the chromatic symmetric functions of trees
- All totally symmetric colored graphs
- Marked Graphs and the Chromatic Symmetric Function
- Quasisymmetric functions distinguishing trees
- The amazing chromatic polynomial
- On the strength of chromatic symmetric homology for graphs
- A rooted variant of Stanley's chromatic symmetric function
- A class of trees determined by their chromatic symmetric functions
- Homogeneous sets in graphs and a chromatic multisymmetric function
- A large class of conjecturally stable chromatic symmetric functions
- An update on Haiman's conjectures
- The chromatic symmetric function of a graph centred at a vertex
- Chromatic symmetric functions and polynomial invariants of trees
- The e-positivity of some new classes of graphs
- Can you tell a tree from its branches?
- Chromatic symmetric functions of conjoined graphs
- The chromatic symmetric function in the star-basis
- Clocks are e-positive
- The e-positivity of the chromatic symmetric function for twinned paths and cycles
- Down-up algebras and chromatic symmetric functions
- A composition method for neat formulas of chromatic symmetric functions
- Schur-positivity for generalized nets
- On graphs with equal and different Kromatic symmetric functions
- The chromatic symmetric function for unicyclic graphs
- The kernel of chromatic quasisymmetric functions on graphs and hypergraphic polytopes
- Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs
- Chromatic bases for symmetric functions
This page was built for publication: Graphs with equal chromatic symmetric functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394351)
