On the Number of Ways of Colouring a Map

Abstract

It is well known that any map of n regions on a sphere may be coloured in five or fewer colours. The purpose of the present note is to prove the following Theorem . If P n (λ) denotes the number of ways of colouring any ma: of n regions on the sphere in λ (or fewer) colours, then (1) This inequality obviously holds for λ = 1, 2, 3 so that we may confine attention to the case λ > 4. Furthermore it holds for n = 3, 4 since the first region may be coloured in λ ways, the second in at least λ — 1 ways, the third in at least λ — 2 ways, and the fourth, if there be one, in at least λ — 3 ways.

Locations

• Proceedings of the Edinburgh Mathematical Society - View - PDF