Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials

DOI10.1080/10586458.2006.10128969zbMath1120.05032OpenAlexW2148292868WikidataQ123111394 ScholiaQ123111394MaRDI QIDQ3431992

Per Håkan Lundow, Klas Markström

Publication date: 13 April 2007

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/223876

zbMATH Keywords

chromatic polynomiallog-concavity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations ⋮ \( h\)-vectors of matroids and logarithmic concavity ⋮ A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges ⋮ Problems on chromatic polynomials of hypergraphs

This page was built for publication: Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials