Four Colour Theorem The 2019 Stack Overflow Developer Survey Results Are In Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Did the Appel/Haken graph colouring (four colour map) proof really not contribute to understanding?How many different game situations has connect four?$Z_n backslash 0$ splits into octetsThe four colour theoremKempe's proof of the four colour theoremChessboard 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 theoremStrategies in Memory game

Difference between "generating set" and free product?

He got a vote 80% that of Emmanuel Macron’s

does high air pressure throw off wheel balance?

Can the DM override racial traits?

Am I ethically obligated to go into work on an off day if the reason is sudden?

Is every episode of "Where are my Pants?" identical?

When did F become S in typeography, and why?

How are presidential pardons supposed to be used?

Finding the path in a graph from A to B then back to A with a minimum of shared edges

How long does the line of fire that you can create as an action using the Investiture of Flame spell last?

Are my PIs rude or am I just being too sensitive?

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

Semisimplicity of the category of coherent sheaves?

How to pronounce 1ターン?

Road tyres vs "Street" tyres for charity ride on MTB Tandem

Do warforged have souls?

Make it rain characters

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

Derivation tree not rendering

How can I protect witches in combat who wear limited clothing?

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

What force causes entropy to increase?

Was credit for the black hole image misattributed?

Keeping a retro style to sci-fi spaceships?



Four Colour Theorem



The 2019 Stack Overflow Developer Survey Results Are In
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Did the Appel/Haken graph colouring (four colour map) proof really not contribute to understanding?How many different game situations has connect four?$Z_n backslash 0$ splits into octetsThe four colour theoremKempe's proof of the four colour theoremChessboard 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 theoremStrategies in Memory game










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).










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
    1 hour 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
    1 hour ago










  • $begingroup$
    thank you for your suggestion, I made a few clarifications.
    $endgroup$
    – Bor Kari
    46 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).










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
    1 hour 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
    1 hour ago










  • $begingroup$
    thank you for your suggestion, I made a few clarifications.
    $endgroup$
    – Bor Kari
    46 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).










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






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 1 hour ago







Bor Kari

















asked 1 hour 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
    1 hour 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
    1 hour ago










  • $begingroup$
    thank you for your suggestion, I made a few clarifications.
    $endgroup$
    – Bor Kari
    46 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
    1 hour 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
    1 hour ago










  • $begingroup$
    thank you for your suggestion, I made a few clarifications.
    $endgroup$
    – Bor Kari
    46 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
1 hour 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
1 hour 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
1 hour 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
1 hour ago












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




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










1 Answer
1






active

oldest

votes


















3












$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
    25 mins 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
    24 mins ago










  • $begingroup$
    That's pretty good. A simple standard: at least one drivable road between neighbors
    $endgroup$
    – Will Jagy
    20 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%2ffour-colour-theorem%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









3












$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
    25 mins 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
    24 mins ago










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















3












$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
    25 mins 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
    24 mins ago










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













3












3








3





$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 16 mins ago

























answered 50 mins 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
    25 mins 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
    24 mins ago










  • $begingroup$
    That's pretty good. A simple standard: at least one drivable road between neighbors
    $endgroup$
    – Will Jagy
    20 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
    25 mins 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
    24 mins ago










  • $begingroup$
    That's pretty good. A simple standard: at least one drivable road between neighbors
    $endgroup$
    – Will Jagy
    20 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
25 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
25 mins 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
24 mins 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
24 mins ago












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




$begingroup$
That's pretty good. A simple standard: at least one drivable road between neighbors
$endgroup$
– Will Jagy
20 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%2ffour-colour-theorem%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

Invision Community Contents History See also References External links Navigation menuProprietaryinvisioncommunity.comIPS Community ForumsIPS Community Forumsthis blog entry"License Changes, IP.Board 3.4, and the Future""Interview -- Matt Mecham of Ibforums""CEO Invision Power Board, Matt Mecham Is a Liar, Thief!"IPB License Explanation 1.3, 1.3.1, 2.0, and 2.1ArchivedSecurity Fixes, Updates And Enhancements For IPB 1.3.1Archived"New Demo Accounts - Invision Power Services"the original"New Default Skin"the original"Invision Power Board 3.0.0 and Applications Released"the original"Archived copy"the original"Perpetual licenses being done away with""Release Notes - Invision Power Services""Introducing: IPS Community Suite 4!"Invision Community Release Notes

Canceling a color specificationRandomly assigning color to Graphics3D objects?Default color for Filling in Mathematica 9Coloring specific elements of sets with a prime modified order in an array plotHow to pick a color differing significantly from the colors already in a given color list?Detection of the text colorColor numbers based on their valueCan color schemes for use with ColorData include opacity specification?My dynamic color schemes

Ласкавець круглолистий Зміст Опис | Поширення | Галерея | Примітки | Посилання | Навігаційне меню58171138361-22960890446Bupleurum rotundifoliumEuro+Med PlantbasePlants of the World Online — Kew ScienceGermplasm Resources Information Network (GRIN)Ласкавецькн. VI : Літери Ком — Левиправивши або дописавши її