Top Posts
Recent comments
- Peter Cameron on Bad times
- Sam Stevenson on Bad times
- Joshua Paik on EDI
- The Quoter « Log24 on COP26
- Kathle Cameron on COP26
Blogroll
- Astronomy Picture of the Day
- Azimuth
- British Combinatorial Committee
- Comfortably numbered
- Diamond Geezer
- Exploring East London
- From hill to sea
- Gödel's lost letter and P=NP
- Gil Kalai
- Jane's London
- Jon Awbrey
- Kourovka Notebook
- LMS blogs page
- Log24
- London Algebra Colloquium
- London Reconnections
- MathBlogging
- Micromath
- Neill Cameron
- neverendingbooks
- Noncommutative geometry
- numericana hall of fame
- Ratio bound
- Robert A. Wilson's blog
- Since it is not …
- Spitalfields life
- Sylvy's mathsy blog
- SymOmega
- Terry Tao
- The Aperiodical
- The De Morgan Journal
- The ICA
- The London column
- The Lumber Room
- The matroid union
- Theorem of the day
- Tim Gowers
- XKCD
Find me on the web
Cameron Counts: RSS feeds
Meta
Tag Archives: graph colouring
Algebraic properties of chromatic roots
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
Random orbits on colourings, or nested Markov chains
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 graph colouring, Markov chain, orbits, random walk
Leave a comment
Orbital combinatorics
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
