Pages

▼

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.


at

13 comments:

  1. wheelsandwingsMay 1, 2011 at 5:06 AM

    4-color theorem

    ReplyDelete
  2. pranavMay 1, 2011 at 1:28 PM

    something like all the countries in a continent can be coloured using 4 colours such that no colour is next to each other.

    ReplyDelete
  3. Ruhi shirodkarMay 1, 2011 at 4:32 PM

    Four colour theorem

    ReplyDelete
  4. prashanthMay 1, 2011 at 5:53 PM

    4 colour theorem...

    ReplyDelete
  5. indianMay 2, 2011 at 5:02 PM

    four colour problem.

    ReplyDelete
  6. Rahul VarmaMay 2, 2011 at 10:19 PM

    Even though I see A lot of colours I would like to go on with a FOUR COLOURED THEOREM

    ReplyDelete
  7. Amit DandekarMay 2, 2011 at 10:50 PM

    Four color theorem

    ReplyDelete
  8. AdiMay 3, 2011 at 10:25 AM

    Four colour theorem?

    ReplyDelete
  9. Siddarth PaiMay 3, 2011 at 10:42 PM

    4 colours theorem

    ReplyDelete
  10. StumblerMay 4, 2011 at 7:41 AM

    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.

    ReplyDelete
  11. VasudevMay 4, 2011 at 3:14 PM

    4 colour theorom?

    ReplyDelete
  12. TejasMay 4, 2011 at 8:18 PM

    Four color theorem

    ReplyDelete
  13. FahadJune 24, 2011 at 8:25 PM

    Was asked in TIIF Quiz '10....

    #nostalgia :)

    ReplyDelete