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

\(e\)-positivechromatic symmetric functionclaw-free graphs

Mathematics Subject Classification ID

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

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

• 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.
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• 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

(24)

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

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)