Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-28T08:38:02.695Z Has data issue: false hasContentIssue false
  • English
  • Français

A graph-colouring theorem

Published online by Cambridge University Press:  22 September 2016

R. C. Walker
R. C. Walker*
Affiliation:
29 Station Road, Arlesey, Beds. SG15 6RG
Get access Rights & Permissions [Opens in a new window]

Extract

Imagine six drawing pins stuck in the wall. If we stretch threads, either red or blue, between every pair of pins, we inevitably create at least one triangle all of one colour. This we shall call Theorem 1: the proof follows.

Consider any pin. From this emanate five threads (since there are five other pins), of which three must be of one colour. We may without loss of generality assume that they are three red threads.

Type
Research Article
Information
The Mathematical Gazette , Volume 60 , Issue 411 , March 1976 , pp. 54 - 57
Copyright
Copyright © Mathematical Association 1976

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Martin, Gardner, Mathematical games, Scient. Am. 228 (1), 108 (January 1973).Google Scholar