Colouring the Plane
by Michael Payne
Abstract: The Chromatic Number of the Plane problems asks for the least number of colours required to colour the plane so that points distance one
apart receive different colours. Created in 1950, the problem has resisted all attempts to improve on the initial bounds (between 4 and
7) found soon afterwards. Of course, faced with such resistance mathematicians have studied many variations on the problem and found
some interesting results. I will talk about some such variations, namely the study of measurable colourings, graphs whose measurable and
general chromatic numbers differ, colourings of large subgraphs of the plane, and perhaps more if time permits.
For More Information: contact: David Wood. email email@example.com