Regular readers of this blog (hi mum!) will already know that chromatic polynomials are one of my favourite research topics, and one on which I have made several posts.
Well, when I was in Sydney last year, my old friend Graham Farr pointed out that the cusp of 2012/2013 is the centenary of the chromatic polynomial, because the paper in which it originated “A determinant formula for the number of ways of coloring a map” was published in the Annals of Mathematics, 14 and dated 1912-1913. Of course the original aim was to prove the four-colour theorem quantitatively by showing that for any planar graph , but this never worked out.
So it’s now been 100 years since the chromatic polynomial arrived, and there’s still lots about it that we don’t understand, so Happy Birthday, Chromatic Polynomial!
One of the most irritating things that we don’t understand is actually the very first conjecture about chromatic roots. In 1946, Birkhoff & Lewis did manage to prove that for a planar graph and any real and started the study of real chromatic roots. They also conjectured that for any real which of course implies the four-colour theorem and more. While chromatic roots (integer, real, complex) have been intensively studied, partly because the chromatic polynomial is intimately related to the partition function of the -state Potts model, it is slightly embarrassing that we cannot even answer this very first problem, now obviously known as the Birkhoff-Lewis conjecture.
Birkhoff-Lewis conjecture: If is a planar graph then for .
I’ve tried quite hard to solve this problem, but there are no obvious weak points to attack. Beraha and Kahane showed that planar graphs have complex chromatic roots arbitrarily close to , while Sokal showed that they have complex chromatic roots arbitrarily close to any point in the complex plane and I showed that they have real chromatic roots arbitrarily close to, but smaller than, .
So it’s just this one little interval that is the only possibly unresolved root-free region amidst a sea of chromatic roots! I’m busy applying for grants now and working up to another attack on chromatic roots. I won’t promise to solve this problem of course, because it’s obviously hard, but I can always hope!