Library / UKMT Senior Mathematical Challenge /57 of 212

UKMT Senior Mathematical Challenge, 2017

Combinatorics Difficulty 2.0 Junior Find the answer United Kingdom

The circles in the diagram are to be coloured so that any two circles connected by a line segment have different colours. What is the smallest number of colours required?

(A) $2$ (B) $3$ (C) $4$ (D) $5$ (E) $6$

Figure for this problem

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: UK Mathematics Trust, licensed © UK Mathematics Trust; past papers published free at ukmt.org.uk. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.