Jump to content

A Colorful Unsolved Problem - Numberphile


Recommended Posts

Hi Khurram!

The graph coloring problem is an old problem -- it was solved a few decades ago, using a lot of computer work -- the old conjecture that you need only 4 colors was finally proven -- with a lot of computer work.

Aubrey is considering a modification -- add the restriction that all lines in the planar graph are lenght one.  Then, he purports to show that you need at least 5 colors.


    --  Saul

Link to comment
Share on other sites


This topic is now archived and is closed to further replies.

  • Create New...