How to colour the US map with Yellow, Green, Red and Blue to minimize the number of states with the colour of...












7












$begingroup$


I want to colour the US (only the states) map with Yellow, Green, Red and Blue. I was wondering what would be the lowest number of states with the colour of Green. We can of course use the other colours as much as we want. Please note that I want to follow the Four Color Theorem rules.



Motivation:
I am studying graph theory and I want to know if there is a way that we could limit the use of the fourth colour as much as possible. This is not a homework problem.



My attempt:
I have tried many variations and can limit it to 6 and it seems like the
minimum possible but there are infinite possibilities to try so I was wondering if there is a simpler method? Thank you in advance.



Clarification:
I am interested in only the mainland of USA. For states like Michigan that are split, I used the same colour for both parts (since they were not connected directly).






graph-theory recreational-mathematics







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    you would need to agree on a favorite version of the graph. In the actual US, there are islands, states split into disconnected regions, other things forbidden
    $endgroup$
    – Will Jagy
    2 hours ago






  • 1




    $begingroup$
    blog.computationalcomplexity.org/2006/05/… They correctly point out that three colors cannot work, as Nevada has an odd number of neighbors
    $endgroup$
    – Will Jagy
    2 hours ago










  • $begingroup$
    thank you for your suggestion, I made a few clarifications.
    $endgroup$
    – Bor Kari
    1 hour ago










  • $begingroup$
    I've edited your title to make it more specific and informative. Please check if it is correct.
    $endgroup$
    – YuiTo Cheng
    24 mins ago
















7












$begingroup$


I want to colour the US (only the states) map with Yellow, Green, Red and Blue. I was wondering what would be the lowest number of states with the colour of Green. We can of course use the other colours as much as we want. Please note that I want to follow the Four Color Theorem rules.



Motivation:
I am studying graph theory and I want to know if there is a way that we could limit the use of the fourth colour as much as possible. This is not a homework problem.



My attempt:
I have tried many variations and can limit it to 6 and it seems like the
minimum possible but there are infinite possibilities to try so I was wondering if there is a simpler method? Thank you in advance.



Clarification:
I am interested in only the mainland of USA. For states like Michigan that are split, I used the same colour for both parts (since they were not connected directly).






graph-theory recreational-mathematics







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    you would need to agree on a favorite version of the graph. In the actual US, there are islands, states split into disconnected regions, other things forbidden
    $endgroup$
    – Will Jagy
    2 hours ago






  • 1




    $begingroup$
    blog.computationalcomplexity.org/2006/05/… They correctly point out that three colors cannot work, as Nevada has an odd number of neighbors
    $endgroup$
    – Will Jagy
    2 hours ago










  • $begingroup$
    thank you for your suggestion, I made a few clarifications.
    $endgroup$
    – Bor Kari
    1 hour ago










  • $begingroup$
    I've edited your title to make it more specific and informative. Please check if it is correct.
    $endgroup$
    – YuiTo Cheng
    24 mins ago














7












7








7


2



$begingroup$


I want to colour the US (only the states) map with Yellow, Green, Red and Blue. I was wondering what would be the lowest number of states with the colour of Green. We can of course use the other colours as much as we want. Please note that I want to follow the Four Color Theorem rules.



Motivation:
I am studying graph theory and I want to know if there is a way that we could limit the use of the fourth colour as much as possible. This is not a homework problem.



My attempt:
I have tried many variations and can limit it to 6 and it seems like the
minimum possible but there are infinite possibilities to try so I was wondering if there is a simpler method? Thank you in advance.



Clarification:
I am interested in only the mainland of USA. For states like Michigan that are split, I used the same colour for both parts (since they were not connected directly).






graph-theory recreational-mathematics







share|cite|improve this question











$endgroup$




I want to colour the US (only the states) map with Yellow, Green, Red and Blue. I was wondering what would be the lowest number of states with the colour of Green. We can of course use the other colours as much as we want. Please note that I want to follow the Four Color Theorem rules.



Motivation:
I am studying graph theory and I want to know if there is a way that we could limit the use of the fourth colour as much as possible. This is not a homework problem.



My attempt:
I have tried many variations and can limit it to 6 and it seems like the
minimum possible but there are infinite possibilities to try so I was wondering if there is a simpler method? Thank you in advance.



Clarification:
I am interested in only the mainland of USA. For states like Michigan that are split, I used the same colour for both parts (since they were not connected directly).






graph-theory recreational-mathematics




graph-theory recreational-mathematics






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 24 mins ago









YuiTo Cheng

2,40641037




2,40641037










asked 2 hours ago









Bor KariBor Kari

3749




3749








  • 1




    $begingroup$
    you would need to agree on a favorite version of the graph. In the actual US, there are islands, states split into disconnected regions, other things forbidden
    $endgroup$
    – Will Jagy
    2 hours ago






  • 1




    $begingroup$
    blog.computationalcomplexity.org/2006/05/… They correctly point out that three colors cannot work, as Nevada has an odd number of neighbors
    $endgroup$
    – Will Jagy
    2 hours ago










  • $begingroup$
    thank you for your suggestion, I made a few clarifications.
    $endgroup$
    – Bor Kari
    1 hour ago










  • $begingroup$
    I've edited your title to make it more specific and informative. Please check if it is correct.
    $endgroup$
    – YuiTo Cheng
    24 mins ago














  • 1




    $begingroup$
    you would need to agree on a favorite version of the graph. In the actual US, there are islands, states split into disconnected regions, other things forbidden
    $endgroup$
    – Will Jagy
    2 hours ago






  • 1




    $begingroup$
    blog.computationalcomplexity.org/2006/05/… They correctly point out that three colors cannot work, as Nevada has an odd number of neighbors
    $endgroup$
    – Will Jagy
    2 hours ago










  • $begingroup$
    thank you for your suggestion, I made a few clarifications.
    $endgroup$
    – Bor Kari
    1 hour ago










  • $begingroup$
    I've edited your title to make it more specific and informative. Please check if it is correct.
    $endgroup$
    – YuiTo Cheng
    24 mins ago








1




1




$begingroup$
you would need to agree on a favorite version of the graph. In the actual US, there are islands, states split into disconnected regions, other things forbidden
$endgroup$
– Will Jagy
2 hours ago




$begingroup$
you would need to agree on a favorite version of the graph. In the actual US, there are islands, states split into disconnected regions, other things forbidden
$endgroup$
– Will Jagy
2 hours ago




1




1




$begingroup$
blog.computationalcomplexity.org/2006/05/… They correctly point out that three colors cannot work, as Nevada has an odd number of neighbors
$endgroup$
– Will Jagy
2 hours ago




$begingroup$
blog.computationalcomplexity.org/2006/05/… They correctly point out that three colors cannot work, as Nevada has an odd number of neighbors
$endgroup$
– Will Jagy
2 hours ago












$begingroup$
thank you for your suggestion, I made a few clarifications.
$endgroup$
– Bor Kari
1 hour ago




$begingroup$
thank you for your suggestion, I made a few clarifications.
$endgroup$
– Bor Kari
1 hour ago












$begingroup$
I've edited your title to make it more specific and informative. Please check if it is correct.
$endgroup$
– YuiTo Cheng
24 mins ago




$begingroup$
I've edited your title to make it more specific and informative. Please check if it is correct.
$endgroup$
– YuiTo Cheng
24 mins ago










1 Answer
1






active

oldest

votes


















5












$begingroup$

The minimum is two states that use the fourth color. Nevada and its five neighbors cannot be colored with only three colors, and similarly West Virginia and its five neighbors cannot be colored with only three colors.



But if we color Arizona and Ohio a color we use nowhere else, then the remainder of the map can be completed using only three colors:



enter image description here



Adjacencies between the states may be easier to see here.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    I need a better atlas. I'm looking at the Philadelphia area, I cannot tell what happens among Pennsylvania, New Jersey, Delaware, Maryland.
    $endgroup$
    – Will Jagy
    1 hour ago










  • $begingroup$
    @WillJagy The reference I actually used to color the US was this picture of the US graph, which solves this problem.
    $endgroup$
    – Misha Lavrov
    1 hour ago










  • $begingroup$
    That's pretty good. A simple standard: at least one drivable road between neighbors
    $endgroup$
    – Will Jagy
    1 hour ago






  • 1




    $begingroup$
    just curious -- did you write code to do this, or did you do this by hand?
    $endgroup$
    – antkam
    56 mins ago












Your Answer








StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3186983%2fhow-to-colour-the-us-map-with-yellow-green-red-and-blue-to-minimize-the-number%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









5












$begingroup$

The minimum is two states that use the fourth color. Nevada and its five neighbors cannot be colored with only three colors, and similarly West Virginia and its five neighbors cannot be colored with only three colors.



But if we color Arizona and Ohio a color we use nowhere else, then the remainder of the map can be completed using only three colors:



enter image description here



Adjacencies between the states may be easier to see here.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    I need a better atlas. I'm looking at the Philadelphia area, I cannot tell what happens among Pennsylvania, New Jersey, Delaware, Maryland.
    $endgroup$
    – Will Jagy
    1 hour ago










  • $begingroup$
    @WillJagy The reference I actually used to color the US was this picture of the US graph, which solves this problem.
    $endgroup$
    – Misha Lavrov
    1 hour ago










  • $begingroup$
    That's pretty good. A simple standard: at least one drivable road between neighbors
    $endgroup$
    – Will Jagy
    1 hour ago






  • 1




    $begingroup$
    just curious -- did you write code to do this, or did you do this by hand?
    $endgroup$
    – antkam
    56 mins ago
















5












$begingroup$

The minimum is two states that use the fourth color. Nevada and its five neighbors cannot be colored with only three colors, and similarly West Virginia and its five neighbors cannot be colored with only three colors.



But if we color Arizona and Ohio a color we use nowhere else, then the remainder of the map can be completed using only three colors:



enter image description here



Adjacencies between the states may be easier to see here.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    I need a better atlas. I'm looking at the Philadelphia area, I cannot tell what happens among Pennsylvania, New Jersey, Delaware, Maryland.
    $endgroup$
    – Will Jagy
    1 hour ago










  • $begingroup$
    @WillJagy The reference I actually used to color the US was this picture of the US graph, which solves this problem.
    $endgroup$
    – Misha Lavrov
    1 hour ago










  • $begingroup$
    That's pretty good. A simple standard: at least one drivable road between neighbors
    $endgroup$
    – Will Jagy
    1 hour ago






  • 1




    $begingroup$
    just curious -- did you write code to do this, or did you do this by hand?
    $endgroup$
    – antkam
    56 mins ago














5












5








5





$begingroup$

The minimum is two states that use the fourth color. Nevada and its five neighbors cannot be colored with only three colors, and similarly West Virginia and its five neighbors cannot be colored with only three colors.



But if we color Arizona and Ohio a color we use nowhere else, then the remainder of the map can be completed using only three colors:



enter image description here



Adjacencies between the states may be easier to see here.






share|cite|improve this answer











$endgroup$



The minimum is two states that use the fourth color. Nevada and its five neighbors cannot be colored with only three colors, and similarly West Virginia and its five neighbors cannot be colored with only three colors.



But if we color Arizona and Ohio a color we use nowhere else, then the remainder of the map can be completed using only three colors:



enter image description here



Adjacencies between the states may be easier to see here.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited 1 hour ago

























answered 1 hour ago









Misha LavrovMisha Lavrov

49.3k757108




49.3k757108












  • $begingroup$
    I need a better atlas. I'm looking at the Philadelphia area, I cannot tell what happens among Pennsylvania, New Jersey, Delaware, Maryland.
    $endgroup$
    – Will Jagy
    1 hour ago










  • $begingroup$
    @WillJagy The reference I actually used to color the US was this picture of the US graph, which solves this problem.
    $endgroup$
    – Misha Lavrov
    1 hour ago










  • $begingroup$
    That's pretty good. A simple standard: at least one drivable road between neighbors
    $endgroup$
    – Will Jagy
    1 hour ago






  • 1




    $begingroup$
    just curious -- did you write code to do this, or did you do this by hand?
    $endgroup$
    – antkam
    56 mins ago


















  • $begingroup$
    I need a better atlas. I'm looking at the Philadelphia area, I cannot tell what happens among Pennsylvania, New Jersey, Delaware, Maryland.
    $endgroup$
    – Will Jagy
    1 hour ago










  • $begingroup$
    @WillJagy The reference I actually used to color the US was this picture of the US graph, which solves this problem.
    $endgroup$
    – Misha Lavrov
    1 hour ago










  • $begingroup$
    That's pretty good. A simple standard: at least one drivable road between neighbors
    $endgroup$
    – Will Jagy
    1 hour ago






  • 1




    $begingroup$
    just curious -- did you write code to do this, or did you do this by hand?
    $endgroup$
    – antkam
    56 mins ago
















$begingroup$
I need a better atlas. I'm looking at the Philadelphia area, I cannot tell what happens among Pennsylvania, New Jersey, Delaware, Maryland.
$endgroup$
– Will Jagy
1 hour ago




$begingroup$
I need a better atlas. I'm looking at the Philadelphia area, I cannot tell what happens among Pennsylvania, New Jersey, Delaware, Maryland.
$endgroup$
– Will Jagy
1 hour ago












$begingroup$
@WillJagy The reference I actually used to color the US was this picture of the US graph, which solves this problem.
$endgroup$
– Misha Lavrov
1 hour ago




$begingroup$
@WillJagy The reference I actually used to color the US was this picture of the US graph, which solves this problem.
$endgroup$
– Misha Lavrov
1 hour ago












$begingroup$
That's pretty good. A simple standard: at least one drivable road between neighbors
$endgroup$
– Will Jagy
1 hour ago




$begingroup$
That's pretty good. A simple standard: at least one drivable road between neighbors
$endgroup$
– Will Jagy
1 hour ago




1




1




$begingroup$
just curious -- did you write code to do this, or did you do this by hand?
$endgroup$
– antkam
56 mins ago




$begingroup$
just curious -- did you write code to do this, or did you do this by hand?
$endgroup$
– antkam
56 mins ago


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3186983%2fhow-to-colour-the-us-map-with-yellow-green-red-and-blue-to-minimize-the-number%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







-

Popular posts from this blog

Olav Thon

Image
Olav Thon Fødd 29. juni 1923 Ål Yrke forretningsdrivande Olav Thon på Commons Olav Thon (fødd 29. juni 1923) er ein norsk, stort sett sjølvlært forretningsmann, fødd i Ål i Hallingdal, som har gjort store pengar på særleg kjøp, bygging og utvikling av fast eigedom, mellom anna kjøpesentre, hotell og restaurantar, i både Noreg og somme andre land. Han vart Ridder av 1. klasse av St. Olavs Orden i 2003, og er som ivrig friluftsmann æresmedlem i Den Norske Turistforening etter å ha ytt store økonomiske bidrag til foreininga sine hytter og ruter i fjellet. Han er kjend for alltid å gå med ei karakteristisk strikkelue. Olav Thon i samtale med Trond Helleland på sentralbanksjefens årstale i februar 2016 I ung alder reiste Olav Thon til Newcastle for å lære seg engelsk, og han var seinare ei tid i Sveits, der han gjorde forretningar i import og eksport. Deretter tok han til å kjøpe faste eigedomar i Noreg med stor økonomisk suksess, verksemda voks snøgt og v
Read more

Waikiki

Image
Denne artikkelen kan ha godt av ein språkvask , som reinskar opp målføringa og/eller innfører same språkstilen overalt. Denne artikkelen kan ha godt av ei opprydding for å nå ein høgare standard og/eller for å verta i tråd med standardoppsettet. Sjå korleis du redigerer ei side og stilmanualen for hjelp. Waikiki Land   USA Stat Hawaii Stad Honolulu Wikimedia Commons: Waikiki Utsyn over Waikiki Waikīkī er ein bydel i Honolulu, sør på øya Oahu, som er ei av Hawaii-øyane. Waikīkīstranda er ein av dei meste berømte strendene i verda. Waikīkī strekkjer seg langs stillehavskysten og har ei rekkje velrenommerte hotell. Bydelen er Hawaii-turismens høyborg. På Waikīkī Beach står ei statue av den lokale sportsstjerna Duka Kahanamoku. Kjelder | Denne artikkelen bygger på «Waikiki» frå Wikipedia på bokmål, den 4. november 2018. Denne artikkelen manglar kjelder eller referansar . Hjelp Wikipedia med å finna truverdige kjelder
Read more

Hudsonelva

Image
Hudson elv Land   USA Område New York Sideelvar Mohawk Lengd 507 km Middelvassføring 606 m³/s Munning Upper New York Bay i Atlanterhavet Elvene Hudson og Mohawk med nedbørsområdet markert med gult. Wikimedia Commons: Hudson River Hudsonelva ( Hudson River ) mohikansk Muh-he-kun-ne-tuk ) er ei elv i USA. Ho renn hovudsakleg gjennom delstaten New York, men markerer også ein del av grensa mellom New York og New Jersey. Hudsonelva har namn etter Henry Hudson, ein engelskmann som utforska elva i 1609. Hudsonelva sett frå Bear Mountain Bridge. Kjelda til elva er Tear-of-the-Clouds-sjøen i Adirondackfjella. Ved Albany renn Mohawk-elva saman med henne, og deretter renn ho nesten rett sørover til ho munnar ut i Atlanterhavet mellom Manhattan i New York og New Jersey. Eriekanalen, som blei opna den 26 oktober 1825, bind saman Hudsonelva og Eriesjøen, slik at byane ved Dei store sjøane fekk vasstilgang til A
Read more