Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs

DOI10.4171/JEMS/974zbMath1444.05142arXiv1703.05770OpenAlexW3031640128MaRDI QIDQ783748

Samantha Dahlberg, Angèle M. Foley, Stephanie Van Willigenburg

Publication date: 4 August 2020

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

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

zbMATH Keywords

claw-free graphelementary symmetric functionchromatic symmetric functionclaw-contractible graph

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Representations of finite symmetric groups (20C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Algebraic aspects of posets (06A11) Connections of Hopf algebras with combinatorics (16T30)

Related Items (11)

On the \(e\)-positivity of trees and spiders ⋮ A combinatorial expansion of vertical-strip LLT polynomials in the basis of elementary symmetric functions ⋮ Spiders and their kin: an investigation of Stanley's chromatic symmetric function for spiders and related graphs ⋮ A combinatorial formula for the Schur coefficients of chromatic symmetric functions ⋮ A rooted variant of Stanley's chromatic symmetric function ⋮ The \(e\)-positivity of two classes of cycle-chord graphs ⋮ Chromatic posets ⋮ A new formula for Stanley's chromatic symmetric function for unit interval graphs and E-positivity for triangular ladder graphs ⋮ The twinning operation on graphs does not always preserve \(e\)-positivity ⋮ Classes of graphs with \(e\)-positive chromatic symmetric function ⋮ The \(e\)-positivity and Schur positivity of some spiders and broom trees

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic quasisymmetric functions
• Evaluations of Hecke algebra traces at Kazhdan-Lusztig basis elements
• Proper caterpillars are distinguished by their chromatic symmetric function
• Graphs with equal chromatic symmetric functions
• A quasisymmetric function generalization of the chromatic symmetric function
• Hook coefficients of chromatic functions
• Scheduling problems
• Intersection theory for graphs
• A weighted graph polynomial from chromatic invariants of knots
• The polychromate and a chord diagram polynomial
• Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
• On immanants of Jacobi-Trudi matrices and permutations with restricted position
• A symmetric function generalization of the chromatic polynomial of a graph
• Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive
• Polynomial graph invariants and the KP hierarchy
• Schur and \(e\)-positivity of trees and cut vertices
• Power sum expansion of chromatic quasisymmetric functions
• The Potts model and chromatic functions of graphs
• On distinguishing trees by their chromatic symmetric functions
• Contractibility and NP-completeness
• Lollipop and Lariat Symmetric Functions
• The interchange graph of a finite graph
• Characterizations of derived graphs
• Unit interval orders and the dot action on the cohomology of regular semisimple Hessenberg varieties
• The cohomology of abelian Hessenberg varieties and the Stanley-Stembridge conjecture
• A chromatic symmetric function in noncommuting variables

This page was built for publication: Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs