Jump to content
Sign in to follow this  

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

Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this