Chromatic symmetric functions and H-free graphs

DOI10.1007/S00373-019-02034-1MaRDI QIDQ2000573zbMATH OpenOpenAlexWikidataFDO

Authors Chính T. Hoàng, Jake E. Tuero, Angèle. M. Hamel

Publication date 28 June 2019

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

claw-free graphschromatic symmetric function\(e\)-positive

Mathematics Subject Classification ID

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

Abstract: Two celebrated conjectures in chromatic symmetric function theory concern the positivity chromatics symmetric functions of claw-free graphs. Here we extend the claw-free idea to general graphs and consider the e-positivity question for H-free graphs where H = {claw, F} and H={claw, F, co-F}, where F is a four-vertex graph. We settle the question for all cases except H={claw, co-diamond}, and we provide some partial results in that case.

Recommendations

• Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs
• On Stanley's chromatic symmetric function and clawfree graphs
• Coloring with a limited paintbox
• Classes of graphs with \(e\)-positive chromatic symmetric function
• On the \(e\)-positivity of \((claw, 2K_2)\)-free graphs

Cites work

• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• A symmetric function generalization of the chromatic polynomial of a graph
• Chromatic bases for symmetric functions
• Classes of graphs with \(e\)-positive chromatic symmetric function
• Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
• Immanants of combinatorial matrices
• Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive
• On immanants of Jacobi-Trudi matrices and permutations with restricted position
• Paw-free graphs
• Proof of a conjecture on immanants of the Jacobi-Trudi matrix
• The chromatic symmetric functions of trivially perfect graphs and cographs
• Vertex coloring of graphs with few obstructions

Cited in

(19)

• Graphs with equal chromatic symmetric functions
• Spiders and their kin: an investigation of Stanley's chromatic symmetric function for spiders and related graphs
• The \(e\)-positivity and Schur positivity of some spiders and broom trees
• Schur and \(e\)-positivity of trees and cut vertices
• The chromatic symmetric functions of trivially perfect graphs and cographs
• \(H\)-chromatic symmetric functions
• Marked Graphs and the Chromatic Symmetric Function
• Chromatic symmetric functions in noncommuting variables revisited
• On Stanley's chromatic symmetric function and clawfree graphs
• Classes of graphs with \(e\)-positive chromatic symmetric function
• On the \(e\)-positivity of \((claw, 2K_2)\)-free graphs
• Coloring with a limited paintbox
• Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive
• A combinatorial formula for the Schur coefficients of chromatic symmetric functions
• Chromatic posets
• On the chromatic number of certain highly symmetric graphs
• Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs
• Recoloring some hereditary graph classes
• The twinning operation on graphs does not always preserve \(e\)-positivity

This page was built for publication: Chromatic symmetric functions and \(H\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000573)