How to colour the US map with Yellow, Green, Red and Blue to minimize the number of states with the colour of Green Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Did the Appel/Haken graph colouring (four colour map) proof really not contribute to understanding?How many four-vertex graphs are there up to isomorphism;$Z_n backslash 0$ splits into octetsHow many different cubes can be obtained if four colours are used?Coloring the 6 vertices of a regular hexagon with a limited use per colorKempe's proof of the four colour theoremAlgorithm to solve this grid puzzle?Explain this proof of the 5-color theoremFinding a maximum connected planar graph to prove the four colour theoremGraph colouring problem
Trademark violation for app?
1-probability to calculate two events in a row
How would a mousetrap for use in space work?
How long can equipment go unused before powering up runs the risk of damage?
How can I set the aperture on my DSLR when it's attached to a telescope instead of a lens?
Misunderstanding of Sylow theory
Why do early math courses focus on the cross sections of a cone and not on other 3D objects?
How much damage would a cupful of neutron star matter do to the Earth?
If Windows 7 doesn't support WSL, then what is "Subsystem for UNIX-based Applications"?
What makes a man succeed?
Is there any word for a place full of confusion?
Did Mueller's report provide an evidentiary basis for the claim of Russian govt election interference via social media?
Central Vacuuming: Is it worth it, and how does it compare to normal vacuuming?
Does the Mueller report show a conspiracy between Russia and the Trump Campaign?
Why weren't discrete x86 CPUs ever used in game hardware?
Lagrange four-squares theorem --- deterministic complexity
How does Belgium enforce obligatory attendance in elections?
Draw 4 of the same figure in the same tikzpicture
What is the meaning of 'breadth' in breadth first search?
What would you call this weird metallic apparatus that allows you to lift people?
Has negative voting ever been officially implemented in elections, or seriously proposed, or even studied?
Random body shuffle every night—can we still function?
Significance of Cersei's obsession with elephants?
Can the Flaming Sphere spell be rammed into multiple Tiny creatures that are in the same 5-foot square?
How to colour the US map with Yellow, Green, Red and Blue to minimize the number of states with the colour of Green
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Did the Appel/Haken graph colouring (four colour map) proof really not contribute to understanding?How many four-vertex graphs are there up to isomorphism;$Z_n backslash 0$ splits into octetsHow many different cubes can be obtained if four colours are used?Coloring the 6 vertices of a regular hexagon with a limited use per colorKempe's proof of the four colour theoremAlgorithm to solve this grid puzzle?Explain this proof of the 5-color theoremFinding a maximum connected planar graph to prove the four colour theoremGraph colouring problem
$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 many possibilities to try ($4^50$). Therefore 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 coloring
asked Apr 14 at 3:32
Bor KariBor Kari
45611
$endgroup$
|
show 2 more comments
$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 many possibilities to try ($4^50$). Therefore 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 coloring
asked Apr 14 at 3:32
Bor KariBor Kari
45611
$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
Apr 14 at 3:36
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
Apr 14 at 3:40
$begingroup$
thank you for your suggestion, I made a few clarifications.
$endgroup$
– Bor Kari
Apr 14 at 4:00
$begingroup$
@WillJagy Maine has an odd number of neighbours too, but that's not much of a problem.
$endgroup$
– Marc van Leeuwen
Apr 14 at 17:09
1
$begingroup$
There are not infinite possibilities. There is only $4^50$ ways of assigning colors to all the states even if we consider no other constraints or symmetries.
$endgroup$
– Derek Elkins
Apr 14 at 20:10
|
show 2 more comments
$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 many possibilities to try ($4^50$). Therefore 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 coloring
asked Apr 14 at 3:32
Bor KariBor Kari
45611
$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 many possibilities to try ($4^50$). Therefore 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 coloring
graph-theory recreational-mathematics coloring
asked Apr 14 at 3:32
Bor KariBor Kari
45611
asked Apr 14 at 3:32
Bor KariBor Kari
45611
edited Apr 14 at 20:53
Bor Kari
asked Apr 14 at 3:32
Bor KariBor Kari
45611
asked Apr 14 at 3:32
Bor KariBor Kari
45611
asked Apr 14 at 3:32
Bor KariBor Kari
45611
45611
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
Apr 14 at 3:36
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
Apr 14 at 3:40
$begingroup$
thank you for your suggestion, I made a few clarifications.
$endgroup$
– Bor Kari
Apr 14 at 4:00
$begingroup$
@WillJagy Maine has an odd number of neighbours too, but that's not much of a problem.
$endgroup$
– Marc van Leeuwen
Apr 14 at 17:09
1
$begingroup$
There are not infinite possibilities. There is only $4^50$ ways of assigning colors to all the states even if we consider no other constraints or symmetries.
$endgroup$
– Derek Elkins
Apr 14 at 20:10
|
show 2 more comments
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
Apr 14 at 3:36
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
Apr 14 at 3:40
$begingroup$
thank you for your suggestion, I made a few clarifications.
$endgroup$
– Bor Kari
Apr 14 at 4:00
$begingroup$
@WillJagy Maine has an odd number of neighbours too, but that's not much of a problem.
$endgroup$
– Marc van Leeuwen
Apr 14 at 17:09
1
$begingroup$
There are not infinite possibilities. There is only $4^50$ ways of assigning colors to all the states even if we consider no other constraints or symmetries.
$endgroup$
– Derek Elkins
Apr 14 at 20:10
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
Apr 14 at 3:36
$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
Apr 14 at 3:36
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
Apr 14 at 3:40
$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
Apr 14 at 3:40
$begingroup$
thank you for your suggestion, I made a few clarifications.
$endgroup$
– Bor Kari
Apr 14 at 4:00
$begingroup$
thank you for your suggestion, I made a few clarifications.
$endgroup$
– Bor Kari
Apr 14 at 4:00
$begingroup$
@WillJagy Maine has an odd number of neighbours too, but that's not much of a problem.
$endgroup$
– Marc van Leeuwen
Apr 14 at 17:09
$begingroup$
@WillJagy Maine has an odd number of neighbours too, but that's not much of a problem.
$endgroup$
– Marc van Leeuwen
Apr 14 at 17:09
1
1
$begingroup$
There are not infinite possibilities. There is only $4^50$ ways of assigning colors to all the states even if we consider no other constraints or symmetries.
$endgroup$
– Derek Elkins
Apr 14 at 20:10
$begingroup$
There are not infinite possibilities. There is only $4^50$ ways of assigning colors to all the states even if we consider no other constraints or symmetries.
$endgroup$
– Derek Elkins
Apr 14 at 20:10
|
show 2 more comments
1 Answer
1
active
oldest
votes
$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. In both cases, once you color the center state one color (say, red), you can't use it again on its neighbors: without using green, they'd have to alternate yellow-blue-yellow-blue, but because the number of neighbors is odd, you'd get stuck at the end.
(In the comments, David K points out that Kentucky is a third state with the same problem: it has seven neighbors. But this doesn't force us to use a third green state, because Kentucky and West Virginia share a border and some common neighbors.)
Using only two green states is possible. If we color Arizona (dealing with the Nevada situation) and Ohio (dealing with West Virginia and Kentucky) both green, then the remainder of the map can be completed using only blue, red, and yellow:
Adjacencies between the states may be easier to see here.
answered Apr 14 at 3:56
Misha LavrovMisha Lavrov
49.9k759110
$endgroup$
2
$begingroup$
just curious -- did you write code to do this, or did you do this by hand?
$endgroup$
– antkam
Apr 14 at 4:56
3
$begingroup$
@antkam By hand. I found two subgraphs where a fourth color is forced, and chose a state from each of them to color green that seemed to be a good choice. Then I just tried to color the rest with three colors - and for that, once you color the first two states, most of the rest of the map is forced, except for a few states like Maine.
$endgroup$
– Misha Lavrov
Apr 14 at 5:56
1
$begingroup$
@WillJagy NJ and MD don't touch because DE interposes. All the other edges exist.
$endgroup$
– hobbs
Apr 14 at 7:35
2
$begingroup$
Kentucky has seven neighbors, but coloring Ohio green fixes that as well as WV. I also notice that you managed to use four colors for UT, CO, AZ, and NM, which makes the map a little clearer but I think is not strictly required by the usual rules, that is, under the usual rules (as far as I know) you could make AZ yellow and CA green.
$endgroup$
– David K
Apr 14 at 13:08
2
$begingroup$
Point of scientific interest: points such as the Four Corners en.wikipedia.org/wiki/Four_Corners_Monument happen only when legislated by humans. In nature, existing edges, such as riverbeds, split on one side in an orthogonal manner, creating a T junction that is, well, typically fractal. One can do an experiment with a plate of wet clay, heat it under a lamp, and watch edges appear as the mud dries out. I will try to find out the name for this...
$endgroup$
– Will Jagy
Apr 14 at 15:58
|
show 7 more comments
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
);
);
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
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
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$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. In both cases, once you color the center state one color (say, red), you can't use it again on its neighbors: without using green, they'd have to alternate yellow-blue-yellow-blue, but because the number of neighbors is odd, you'd get stuck at the end.
(In the comments, David K points out that Kentucky is a third state with the same problem: it has seven neighbors. But this doesn't force us to use a third green state, because Kentucky and West Virginia share a border and some common neighbors.)
Using only two green states is possible. If we color Arizona (dealing with the Nevada situation) and Ohio (dealing with West Virginia and Kentucky) both green, then the remainder of the map can be completed using only blue, red, and yellow:
Adjacencies between the states may be easier to see here.
answered Apr 14 at 3:56
Misha LavrovMisha Lavrov
49.9k759110
$endgroup$
2
$begingroup$
just curious -- did you write code to do this, or did you do this by hand?
$endgroup$
– antkam
Apr 14 at 4:56
3
$begingroup$
@antkam By hand. I found two subgraphs where a fourth color is forced, and chose a state from each of them to color green that seemed to be a good choice. Then I just tried to color the rest with three colors - and for that, once you color the first two states, most of the rest of the map is forced, except for a few states like Maine.
$endgroup$
– Misha Lavrov
Apr 14 at 5:56
1
$begingroup$
@WillJagy NJ and MD don't touch because DE interposes. All the other edges exist.
$endgroup$
– hobbs
Apr 14 at 7:35
2
$begingroup$
Kentucky has seven neighbors, but coloring Ohio green fixes that as well as WV. I also notice that you managed to use four colors for UT, CO, AZ, and NM, which makes the map a little clearer but I think is not strictly required by the usual rules, that is, under the usual rules (as far as I know) you could make AZ yellow and CA green.
$endgroup$
– David K
Apr 14 at 13:08
2
$begingroup$
Point of scientific interest: points such as the Four Corners en.wikipedia.org/wiki/Four_Corners_Monument happen only when legislated by humans. In nature, existing edges, such as riverbeds, split on one side in an orthogonal manner, creating a T junction that is, well, typically fractal. One can do an experiment with a plate of wet clay, heat it under a lamp, and watch edges appear as the mud dries out. I will try to find out the name for this...
$endgroup$
– Will Jagy
Apr 14 at 15:58
|
show 7 more comments
$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. In both cases, once you color the center state one color (say, red), you can't use it again on its neighbors: without using green, they'd have to alternate yellow-blue-yellow-blue, but because the number of neighbors is odd, you'd get stuck at the end.
(In the comments, David K points out that Kentucky is a third state with the same problem: it has seven neighbors. But this doesn't force us to use a third green state, because Kentucky and West Virginia share a border and some common neighbors.)
Using only two green states is possible. If we color Arizona (dealing with the Nevada situation) and Ohio (dealing with West Virginia and Kentucky) both green, then the remainder of the map can be completed using only blue, red, and yellow:
Adjacencies between the states may be easier to see here.
answered Apr 14 at 3:56
Misha LavrovMisha Lavrov
49.9k759110
$endgroup$
2
$begingroup$
just curious -- did you write code to do this, or did you do this by hand?
$endgroup$
– antkam
Apr 14 at 4:56
3
$begingroup$
@antkam By hand. I found two subgraphs where a fourth color is forced, and chose a state from each of them to color green that seemed to be a good choice. Then I just tried to color the rest with three colors - and for that, once you color the first two states, most of the rest of the map is forced, except for a few states like Maine.
$endgroup$
– Misha Lavrov
Apr 14 at 5:56
1
$begingroup$
@WillJagy NJ and MD don't touch because DE interposes. All the other edges exist.
$endgroup$
– hobbs
Apr 14 at 7:35
2
$begingroup$
Kentucky has seven neighbors, but coloring Ohio green fixes that as well as WV. I also notice that you managed to use four colors for UT, CO, AZ, and NM, which makes the map a little clearer but I think is not strictly required by the usual rules, that is, under the usual rules (as far as I know) you could make AZ yellow and CA green.
$endgroup$
– David K
Apr 14 at 13:08
2
$begingroup$
Point of scientific interest: points such as the Four Corners en.wikipedia.org/wiki/Four_Corners_Monument happen only when legislated by humans. In nature, existing edges, such as riverbeds, split on one side in an orthogonal manner, creating a T junction that is, well, typically fractal. One can do an experiment with a plate of wet clay, heat it under a lamp, and watch edges appear as the mud dries out. I will try to find out the name for this...
$endgroup$
– Will Jagy
Apr 14 at 15:58
|
show 7 more comments
$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. In both cases, once you color the center state one color (say, red), you can't use it again on its neighbors: without using green, they'd have to alternate yellow-blue-yellow-blue, but because the number of neighbors is odd, you'd get stuck at the end.
(In the comments, David K points out that Kentucky is a third state with the same problem: it has seven neighbors. But this doesn't force us to use a third green state, because Kentucky and West Virginia share a border and some common neighbors.)
Using only two green states is possible. If we color Arizona (dealing with the Nevada situation) and Ohio (dealing with West Virginia and Kentucky) both green, then the remainder of the map can be completed using only blue, red, and yellow:
Adjacencies between the states may be easier to see here.
answered Apr 14 at 3:56
Misha LavrovMisha Lavrov
49.9k759110
$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. In both cases, once you color the center state one color (say, red), you can't use it again on its neighbors: without using green, they'd have to alternate yellow-blue-yellow-blue, but because the number of neighbors is odd, you'd get stuck at the end.
(In the comments, David K points out that Kentucky is a third state with the same problem: it has seven neighbors. But this doesn't force us to use a third green state, because Kentucky and West Virginia share a border and some common neighbors.)
Using only two green states is possible. If we color Arizona (dealing with the Nevada situation) and Ohio (dealing with West Virginia and Kentucky) both green, then the remainder of the map can be completed using only blue, red, and yellow:
Adjacencies between the states may be easier to see here.
answered Apr 14 at 3:56
Misha LavrovMisha Lavrov
49.9k759110
edited Apr 14 at 14:32
answered Apr 14 at 3:56
Misha LavrovMisha Lavrov
49.9k759110
answered Apr 14 at 3:56
Misha LavrovMisha Lavrov
49.9k759110
answered Apr 14 at 3:56
Misha LavrovMisha Lavrov
49.9k759110
49.9k759110
2
$begingroup$
just curious -- did you write code to do this, or did you do this by hand?
$endgroup$
– antkam
Apr 14 at 4:56
3
$begingroup$
@antkam By hand. I found two subgraphs where a fourth color is forced, and chose a state from each of them to color green that seemed to be a good choice. Then I just tried to color the rest with three colors - and for that, once you color the first two states, most of the rest of the map is forced, except for a few states like Maine.
$endgroup$
– Misha Lavrov
Apr 14 at 5:56
1
$begingroup$
@WillJagy NJ and MD don't touch because DE interposes. All the other edges exist.
$endgroup$
– hobbs
Apr 14 at 7:35
2
$begingroup$
Kentucky has seven neighbors, but coloring Ohio green fixes that as well as WV. I also notice that you managed to use four colors for UT, CO, AZ, and NM, which makes the map a little clearer but I think is not strictly required by the usual rules, that is, under the usual rules (as far as I know) you could make AZ yellow and CA green.
$endgroup$
– David K
Apr 14 at 13:08
2
$begingroup$
Point of scientific interest: points such as the Four Corners en.wikipedia.org/wiki/Four_Corners_Monument happen only when legislated by humans. In nature, existing edges, such as riverbeds, split on one side in an orthogonal manner, creating a T junction that is, well, typically fractal. One can do an experiment with a plate of wet clay, heat it under a lamp, and watch edges appear as the mud dries out. I will try to find out the name for this...
$endgroup$
– Will Jagy
Apr 14 at 15:58
|
show 7 more comments
2
$begingroup$
just curious -- did you write code to do this, or did you do this by hand?
$endgroup$
– antkam
Apr 14 at 4:56
3
$begingroup$
@antkam By hand. I found two subgraphs where a fourth color is forced, and chose a state from each of them to color green that seemed to be a good choice. Then I just tried to color the rest with three colors - and for that, once you color the first two states, most of the rest of the map is forced, except for a few states like Maine.
$endgroup$
– Misha Lavrov
Apr 14 at 5:56
1
$begingroup$
@WillJagy NJ and MD don't touch because DE interposes. All the other edges exist.
$endgroup$
– hobbs
Apr 14 at 7:35
2
$begingroup$
Kentucky has seven neighbors, but coloring Ohio green fixes that as well as WV. I also notice that you managed to use four colors for UT, CO, AZ, and NM, which makes the map a little clearer but I think is not strictly required by the usual rules, that is, under the usual rules (as far as I know) you could make AZ yellow and CA green.
$endgroup$
– David K
Apr 14 at 13:08
2
$begingroup$
Point of scientific interest: points such as the Four Corners en.wikipedia.org/wiki/Four_Corners_Monument happen only when legislated by humans. In nature, existing edges, such as riverbeds, split on one side in an orthogonal manner, creating a T junction that is, well, typically fractal. One can do an experiment with a plate of wet clay, heat it under a lamp, and watch edges appear as the mud dries out. I will try to find out the name for this...
$endgroup$
– Will Jagy
Apr 14 at 15:58
2
2
$begingroup$
just curious -- did you write code to do this, or did you do this by hand?
$endgroup$
– antkam
Apr 14 at 4:56
$begingroup$
just curious -- did you write code to do this, or did you do this by hand?
$endgroup$
– antkam
Apr 14 at 4:56
3
3
$begingroup$
@antkam By hand. I found two subgraphs where a fourth color is forced, and chose a state from each of them to color green that seemed to be a good choice. Then I just tried to color the rest with three colors - and for that, once you color the first two states, most of the rest of the map is forced, except for a few states like Maine.
$endgroup$
– Misha Lavrov
Apr 14 at 5:56
$begingroup$
@antkam By hand. I found two subgraphs where a fourth color is forced, and chose a state from each of them to color green that seemed to be a good choice. Then I just tried to color the rest with three colors - and for that, once you color the first two states, most of the rest of the map is forced, except for a few states like Maine.
$endgroup$
– Misha Lavrov
Apr 14 at 5:56
1
1
$begingroup$
@WillJagy NJ and MD don't touch because DE interposes. All the other edges exist.
$endgroup$
– hobbs
Apr 14 at 7:35
$begingroup$
@WillJagy NJ and MD don't touch because DE interposes. All the other edges exist.
$endgroup$
– hobbs
Apr 14 at 7:35
2
2
$begingroup$
Kentucky has seven neighbors, but coloring Ohio green fixes that as well as WV. I also notice that you managed to use four colors for UT, CO, AZ, and NM, which makes the map a little clearer but I think is not strictly required by the usual rules, that is, under the usual rules (as far as I know) you could make AZ yellow and CA green.
$endgroup$
– David K
Apr 14 at 13:08
$begingroup$
Kentucky has seven neighbors, but coloring Ohio green fixes that as well as WV. I also notice that you managed to use four colors for UT, CO, AZ, and NM, which makes the map a little clearer but I think is not strictly required by the usual rules, that is, under the usual rules (as far as I know) you could make AZ yellow and CA green.
$endgroup$
– David K
Apr 14 at 13:08
2
2
$begingroup$
Point of scientific interest: points such as the Four Corners en.wikipedia.org/wiki/Four_Corners_Monument happen only when legislated by humans. In nature, existing edges, such as riverbeds, split on one side in an orthogonal manner, creating a T junction that is, well, typically fractal. One can do an experiment with a plate of wet clay, heat it under a lamp, and watch edges appear as the mud dries out. I will try to find out the name for this...
$endgroup$
– Will Jagy
Apr 14 at 15:58
$begingroup$
Point of scientific interest: points such as the Four Corners en.wikipedia.org/wiki/Four_Corners_Monument happen only when legislated by humans. In nature, existing edges, such as riverbeds, split on one side in an orthogonal manner, creating a T junction that is, well, typically fractal. One can do an experiment with a plate of wet clay, heat it under a lamp, and watch edges appear as the mud dries out. I will try to find out the name for this...
$endgroup$
– Will Jagy
Apr 14 at 15:58
|
show 7 more comments
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.
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
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
Required, but never shown
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
Required, but never shown
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
Required, but never shown
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
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
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
Apr 14 at 3:36
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
Apr 14 at 3:40
$begingroup$
thank you for your suggestion, I made a few clarifications.
$endgroup$
– Bor Kari
Apr 14 at 4:00
$begingroup$
@WillJagy Maine has an odd number of neighbours too, but that's not much of a problem.
$endgroup$
– Marc van Leeuwen
Apr 14 at 17:09
1
$begingroup$
There are not infinite possibilities. There is only $4^50$ ways of assigning colors to all the states even if we consider no other constraints or symmetries.
$endgroup$
– Derek Elkins
Apr 14 at 20:10