A correlation inequality involving stable set and chromatic polynomials

DOI10.1006/JCTB.1993.1026zbMATH Open0733.05038OpenAlexW2082338474MaRDI QIDQ810040FDOQ810040

Authors: Graham Farr 

Publication date: 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1993.1026

Recommendations

• On partial sums of chromatic polynomials
• An inequality for chromatic polynomials
• Publication:4508372
• Some inequalities on chromatic polynomials
• The chromatic number of random graphs

zbMATH Keywords

graph polynomialchromatic polynomialclique polynomialcorrelation inequalityAhlswede-Daykin Theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cited In (9)

• A weighted graph polynomial from chromatic invariants of knots
• Certificates for properties of stability polynomials of graphs
• The equivalence of two graph polynomials and a symmetric function
• A bibliography on chromatic polynomials
• Some corollaries of a theorem of Whitney on the chromatic polynomial
• An inequality for chromatic polynomials
• The Go polynomials of a graph.
• A new polynomial for polymatroids
• A Tutte decomposition for matrices and bimatroids

This page was built for publication: A correlation inequality involving stable set and chromatic polynomials

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