and you illustrated that using five colors and non-contiguous regions?
-
-
-
It's sometimes called the map coloring problem. Disregard the water and consider each landmass separately.
- 2 more replies
New conversation -
-
-
What about this one? Did I get something wrong?pic.twitter.com/k4NZeYwnzk
-
Can be dine with three colors. Touching corners do not count.
- 1 more reply
New conversation -
-
-
This theorem is brilliant as its making required a substantial amount of careful observation. It's similar to Langrange four-square theorem.pic.twitter.com/YMgk7r1svu
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
I think it's worth mentioning that the current accepted proof of the theorem actually lists all the 'kinds' of maps that are possible, and tests that each one of them can be coloured with 4 colours.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Theorems like this one put limitations to our fancy regarding patterns of nature & show fixedness. Choose your favorite 'limitation' theory.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
no, neighboring in the sense of the theorem means having a common border with finite length
-
I think he’s asking about something like this, where many of the vertices contain more than four angles around them. Yes — this still works; you may have the same color meeting at a shared vertex, but you can still avoid a shared edge with only four colors.pic.twitter.com/JDOJD1sNnS
End of conversation
New conversation -
-
-
The problem remained unsolved for over 100 years
#trivia -
I've written a blog post using the 4 color theorem as an example for an introduction to
#prolog and#logicprogramminghttps://www.matchilling.com/introduction-to-logic-programming-with-prolog/ …
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.