Mrthfx

Who or what is the being for whom Being is a question for Heidegger?

Wall plug outlet change

How to copy the contents of all files with a certain name into a new file?

Reference for the teaching of not-self

Windows 10: How to Lock (not sleep) laptop on lid close?

How do I add random spotting to the same face in cycles?

Difference between "generating set" and free product?

Didn't get enough time to take a Coding Test - what to do now?

What are these Gizmos at Izaña Atmospheric Research Center in Spain?

Can a 1st-level character have an ability score above 18?

Slither Like a Snake

Can a novice safely splice in wire to lengthen 5V charging cable?

Match Roman Numerals

Typeface like Times New Roman but with "tied" percent sign

The variadic template constructor of my class cannot modify my class members, why is that so?

Derivation tree not rendering

When did F become S in typeography, and why?

How to politely respond to generic emails requesting a PhD/job in my lab? Without wasting too much time

Why is the object placed in the middle of the sentence here?

Is this wall load bearing? Blueprints and photos attached

What was the last x86 CPU that did not have the x87 floating-point unit built in?

What force causes entropy to increase?

What can I do if neighbor is blocking my solar panels intentionally?

Can the DM override racial traits?

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

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

edited 25 mins ago

YuiTo Cheng

2,40641037

asked 2 hours ago

Bor KariBor Kari

3749

$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
  

  
  
  
  

add a comment | 

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

edited 25 mins ago

YuiTo Cheng

2,40641037

asked 2 hours ago

Bor KariBor Kari

3749

$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
  

  
  
  
  

add a comment | 

$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

edited 25 mins ago

YuiTo Cheng

2,40641037

asked 2 hours ago

Bor KariBor Kari

3749

$endgroup$

share|cite|improve this question

edited 25 mins ago

YuiTo Cheng

2,40641037

asked 2 hours ago

Bor KariBor Kari

3749

share|cite|improve this question

edited 25 mins ago

YuiTo Cheng

2,40641037

asked 2 hours ago

Bor KariBor Kari

3749

edited 25 mins ago

YuiTo Cheng

2,40641037

edited 25 mins ago

YuiTo Cheng

2,40641037

asked 2 hours ago

Bor KariBor Kari

3749

asked 2 hours ago

Bor KariBor Kari

3749

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:

Adjacencies between the states may be easier to see here.

share|cite|improve this answer

edited 1 hour ago

answered 1 hour ago

Misha LavrovMisha Lavrov

49.3k757108

$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
  

  
  
  
  

add a comment | 

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

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Sign up using Google

Sign up using Facebook

Sign up using Email and Password

Post as a guest

Name

Email

Required, but never shown

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

Name

Email

Required, but never shown

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:

Adjacencies between the states may be easier to see here.

share|cite|improve this answer

edited 1 hour ago

answered 1 hour ago

Misha LavrovMisha Lavrov

49.3k757108

$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
  

  
  
  
  

add a comment | 

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:

Adjacencies between the states may be easier to see here.

share|cite|improve this answer

edited 1 hour ago

answered 1 hour ago

Misha LavrovMisha Lavrov

49.3k757108

$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
  

  
  
  
  

add a comment | 

$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:

Adjacencies between the states may be easier to see here.

share|cite|improve this answer

edited 1 hour ago

answered 1 hour ago

Misha LavrovMisha Lavrov

49.3k757108

$endgroup$

share|cite|improve this answer

edited 1 hour ago

answered 1 hour ago

Misha LavrovMisha Lavrov

49.3k757108

answered 1 hour ago

Misha LavrovMisha Lavrov

49.3k757108

answered 1 hour ago

Misha LavrovMisha Lavrov

49.3k757108