Jump to content

A Colorful Unsolved Problem - Numberphile


KHashmi317
 Share

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

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.
Note: Your post will require moderator approval before it will be visible.

Guest
Reply to this topic...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

Loading...
 Share

×
×
  • Create New...