Homogeneous sets in graphs and a chromatic multisymmetric function
DOI10.1016/J.AAM.2024.102718zbMATH Open1547.05303MaRDI QIDQ6564066
Evan M. Haithcock, Sophie Spirkl, Logan Crew, Josephine Reynes
Publication date: 28 June 2024
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
symmetric functiondeletion-contractionstructural graph theorychromatic symmetric functionStanley-Stembridge conjecturemultisymmetric function
Symmetric functions and generalizations (05E05) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs with equal chromatic symmetric functions
- The kernel of chromatic quasisymmetric functions on graphs and hypergraphic polytopes
- The strong perfect graph theorem
- Multisymmetric functions
- The ring of multisymmetric functions.
- A symmetric function generalization of the chromatic polynomial of a graph
- Modular relations of the Tutte symmetric function
- A combinatorial expansion of vertical-strip LLT polynomials in the basis of elementary symmetric functions
- Positivity of chromatic symmetric functions associated with Hessenberg functions of bounce number 3
- A combinatorial formula for the Schur coefficients of chromatic symmetric functions
- A deletion-contraction relation for the chromatic symmetric function
- Chromatic symmetric functions from the modular law
- Structure and enumeration of \((3+1)\)-free posets
- Schur and \(e\)-positivity of trees and cut vertices
- A new formula for Stanley's chromatic symmetric function for unit interval graphs and E-positivity for triangular ladder graphs
- Classes of graphs with \(e\)-positive chromatic symmetric function
- On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem
- Chromatic symmetric functions via the group algebra of \(S_n\)
- Lollipop and Lariat Symmetric Functions
- On $e$-Positivity and $e$-Unimodality of Chromatic Quasi-symmetric Functions
- On an Algorithm for Comparing the Chromatic Symmetric Functions of Trees
- Chromatic symmetric functions of Dyck paths and \(q\)-rook theory
- Strongly perfect claw‐free graphs—A short proof
This page was built for publication: Homogeneous sets in graphs and a chromatic multisymmetric function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564066)