Tag Archives: graph colouring

Algebraic properties of chromatic roots

Posted on 04/10/2016 by Peter Cameron

It has been a long time coming. I wrote back in 2011 about the work Kerri Morgan and I were doing on algebraic properties of chromatic roots. A paper has just gone on the arXiv. I will just recap here, … Continue reading →

Posted in exposition | Tagged , , , , , , , , | Leave a comment

Random orbits on colourings, or nested Markov chains

Posted on 15/12/2015 by Peter Cameron

I promised after reporting Catherine Greenhill’s talk last week that I would advertise this little problem; so here goes. How do we pick a random proper colouring of a graph Γ? There is a simple Markov chain for this, also … Continue reading →

Posted in exposition, open problems | Tagged , , , | Leave a comment

Orbital combinatorics

Posted on 11/02/2015 by Peter Cameron

Yesterday I went to Edinburgh to give a colloquium talk about synchronization, including the recent stuff about butterflies. The day before, I had discussed Artur Schäfer’s work with him, and he expressed a hope that if he went to the … Continue reading →

Posted in exposition | Tagged , , , , , , , , , , | 1 Comment