Summary of how mathematicians have been able to reduce the number of maps to check in the Four Color theorem
I'm doing an essay on the effectiveness of the ability of computers to help prove the Four Color Theorem. I've looked a lot online but I have not found a good resource specifically answering how mathematicians have been able to reduce the number of maps to check. I also don't have any good resources on the actual algorithm Haken-appel has used. If someone can help provide me some resources or just summarize the answers that would be really helpful.
graph-theory
add a comment |
I'm doing an essay on the effectiveness of the ability of computers to help prove the Four Color Theorem. I've looked a lot online but I have not found a good resource specifically answering how mathematicians have been able to reduce the number of maps to check. I also don't have any good resources on the actual algorithm Haken-appel has used. If someone can help provide me some resources or just summarize the answers that would be really helpful.
graph-theory
If you do not get an answer here, perhaps try also mathoverflow.net
– Tortoise
Dec 1 '18 at 14:17
@Tortoise Sigh, no luck there, nobody would provide help.
– Plzhelp
Dec 2 '18 at 16:44
Yes, I have read the comments there. Strange. Sometimes I understand what is said. Sometimes not. Anyways. I am no expert on the 4-colour-theorem. Perhaps check out "ams.org/journals/era/1996-02-01/S1079-6762-96-00003-0/…". If this does not help you, then - perhaps - you have to conclude that the specific of "how" the reductio nof maps was actually done is not so easy to find out. Good luck.
– Tortoise
Dec 3 '18 at 14:38
@Tortoise Thanks man, at least you tried. I guess I'll just read along and if I get stuck I'll ask here again. Thanks for the luck, hope good fortune comes in your mathematical career :)
– Plzhelp
Dec 3 '18 at 18:04
You are very kind! I wish the same to you.
– Tortoise
Dec 4 '18 at 6:20
add a comment |
I'm doing an essay on the effectiveness of the ability of computers to help prove the Four Color Theorem. I've looked a lot online but I have not found a good resource specifically answering how mathematicians have been able to reduce the number of maps to check. I also don't have any good resources on the actual algorithm Haken-appel has used. If someone can help provide me some resources or just summarize the answers that would be really helpful.
graph-theory
I'm doing an essay on the effectiveness of the ability of computers to help prove the Four Color Theorem. I've looked a lot online but I have not found a good resource specifically answering how mathematicians have been able to reduce the number of maps to check. I also don't have any good resources on the actual algorithm Haken-appel has used. If someone can help provide me some resources or just summarize the answers that would be really helpful.
graph-theory
graph-theory
asked Dec 1 '18 at 14:11
Plzhelp
113
113
If you do not get an answer here, perhaps try also mathoverflow.net
– Tortoise
Dec 1 '18 at 14:17
@Tortoise Sigh, no luck there, nobody would provide help.
– Plzhelp
Dec 2 '18 at 16:44
Yes, I have read the comments there. Strange. Sometimes I understand what is said. Sometimes not. Anyways. I am no expert on the 4-colour-theorem. Perhaps check out "ams.org/journals/era/1996-02-01/S1079-6762-96-00003-0/…". If this does not help you, then - perhaps - you have to conclude that the specific of "how" the reductio nof maps was actually done is not so easy to find out. Good luck.
– Tortoise
Dec 3 '18 at 14:38
@Tortoise Thanks man, at least you tried. I guess I'll just read along and if I get stuck I'll ask here again. Thanks for the luck, hope good fortune comes in your mathematical career :)
– Plzhelp
Dec 3 '18 at 18:04
You are very kind! I wish the same to you.
– Tortoise
Dec 4 '18 at 6:20
add a comment |
If you do not get an answer here, perhaps try also mathoverflow.net
– Tortoise
Dec 1 '18 at 14:17
@Tortoise Sigh, no luck there, nobody would provide help.
– Plzhelp
Dec 2 '18 at 16:44
Yes, I have read the comments there. Strange. Sometimes I understand what is said. Sometimes not. Anyways. I am no expert on the 4-colour-theorem. Perhaps check out "ams.org/journals/era/1996-02-01/S1079-6762-96-00003-0/…". If this does not help you, then - perhaps - you have to conclude that the specific of "how" the reductio nof maps was actually done is not so easy to find out. Good luck.
– Tortoise
Dec 3 '18 at 14:38
@Tortoise Thanks man, at least you tried. I guess I'll just read along and if I get stuck I'll ask here again. Thanks for the luck, hope good fortune comes in your mathematical career :)
– Plzhelp
Dec 3 '18 at 18:04
You are very kind! I wish the same to you.
– Tortoise
Dec 4 '18 at 6:20
If you do not get an answer here, perhaps try also mathoverflow.net
– Tortoise
Dec 1 '18 at 14:17
If you do not get an answer here, perhaps try also mathoverflow.net
– Tortoise
Dec 1 '18 at 14:17
@Tortoise Sigh, no luck there, nobody would provide help.
– Plzhelp
Dec 2 '18 at 16:44
@Tortoise Sigh, no luck there, nobody would provide help.
– Plzhelp
Dec 2 '18 at 16:44
Yes, I have read the comments there. Strange. Sometimes I understand what is said. Sometimes not. Anyways. I am no expert on the 4-colour-theorem. Perhaps check out "ams.org/journals/era/1996-02-01/S1079-6762-96-00003-0/…". If this does not help you, then - perhaps - you have to conclude that the specific of "how" the reductio nof maps was actually done is not so easy to find out. Good luck.
– Tortoise
Dec 3 '18 at 14:38
Yes, I have read the comments there. Strange. Sometimes I understand what is said. Sometimes not. Anyways. I am no expert on the 4-colour-theorem. Perhaps check out "ams.org/journals/era/1996-02-01/S1079-6762-96-00003-0/…". If this does not help you, then - perhaps - you have to conclude that the specific of "how" the reductio nof maps was actually done is not so easy to find out. Good luck.
– Tortoise
Dec 3 '18 at 14:38
@Tortoise Thanks man, at least you tried. I guess I'll just read along and if I get stuck I'll ask here again. Thanks for the luck, hope good fortune comes in your mathematical career :)
– Plzhelp
Dec 3 '18 at 18:04
@Tortoise Thanks man, at least you tried. I guess I'll just read along and if I get stuck I'll ask here again. Thanks for the luck, hope good fortune comes in your mathematical career :)
– Plzhelp
Dec 3 '18 at 18:04
You are very kind! I wish the same to you.
– Tortoise
Dec 4 '18 at 6:20
You are very kind! I wish the same to you.
– Tortoise
Dec 4 '18 at 6:20
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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%2f3021388%2fsummary-of-how-mathematicians-have-been-able-to-reduce-the-number-of-maps-to-che%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3021388%2fsummary-of-how-mathematicians-have-been-able-to-reduce-the-number-of-maps-to-che%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
If you do not get an answer here, perhaps try also mathoverflow.net
– Tortoise
Dec 1 '18 at 14:17
@Tortoise Sigh, no luck there, nobody would provide help.
– Plzhelp
Dec 2 '18 at 16:44
Yes, I have read the comments there. Strange. Sometimes I understand what is said. Sometimes not. Anyways. I am no expert on the 4-colour-theorem. Perhaps check out "ams.org/journals/era/1996-02-01/S1079-6762-96-00003-0/…". If this does not help you, then - perhaps - you have to conclude that the specific of "how" the reductio nof maps was actually done is not so easy to find out. Good luck.
– Tortoise
Dec 3 '18 at 14:38
@Tortoise Thanks man, at least you tried. I guess I'll just read along and if I get stuck I'll ask here again. Thanks for the luck, hope good fortune comes in your mathematical career :)
– Plzhelp
Dec 3 '18 at 18:04
You are very kind! I wish the same to you.
– Tortoise
Dec 4 '18 at 6:20