A correlation inequality involving stable set and chromatic polynomials

DOI10.1006/jctb.1993.1026zbMath0733.05038OpenAlexW2082338474MaRDI QIDQ810040

Graham E. 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

zbMATH Keywords

chromatic polynomialgraph polynomialclique polynomialcorrelation inequalityAhlswede-Daykin Theorem

Mathematics Subject Classification ID

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

Related Items (7)

A bibliography on chromatic polynomials ⋮ Certificates for properties of stability polynomials of graphs ⋮ Unnamed Item ⋮ The Go polynomials of a graph. ⋮ The Equivalence of Two Graph Polynomials and a Symmetric Function ⋮ A weighted graph polynomial from chromatic invariants of knots ⋮ A Tutte decomposition for matrices and bimatroids

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