Illustrations of the theorem:
Answer: Four Coloured Theorem. It states that any planar graph/map can be filled with a minimum four colours such that no two adjacent spaces are filled with the same colour. In short, see the pics.
Saturday, April 30, 2011
Question 1101: Tetrapacked!
X is a theorem which is yet to be proved, although it is one of the major theorems to have a computer-assisted proof (not counted as a REAL proof). It was first put forward by Francis Guthrie, whose brother then took it to De Morgan.
Illustrations of the theorem:
Answer: Four Coloured Theorem. It states that any planar graph/map can be filled with a minimum four colours such that no two adjacent spaces are filled with the same colour. In short, see the pics.
Illustrations of the theorem:
Answer: Four Coloured Theorem. It states that any planar graph/map can be filled with a minimum four colours such that no two adjacent spaces are filled with the same colour. In short, see the pics.
Subscribe to:
Post Comments (Atom)
13 Answers:
4-color theorem
something like all the countries in a continent can be coloured using 4 colours such that no colour is next to each other.
Four colour theorem
4 colour theorem...
four colour problem.
Even though I see A lot of colours I would like to go on with a FOUR COLOURED THEOREM
Four color theorem
Four colour theorem?
4 colours theorem
The four colour map theorem - the problem of shading all the countries on a map using just 4 colours while ensuring that no two adjacent countries are shaded with the same hues.
4 colour theorom?
Four color theorem
Was asked in TIIF Quiz '10....
#nostalgia :)
Post a Comment