Jump to content

Talk:Four color theorem

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by CiaPan (talk | contribs) at 10:55, 3 March 2021 (Simple Proof: minor addition). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Template:Vital article

Former good article nomineeFour color theorem was a Mathematics good articles nominee, but did not meet the good article criteria at the time. There may be suggestions below for improving the article. Once these issues have been addressed, the article can be renominated. Editors may also seek a reassessment of the decision if they believe there was a mistake.
Article milestones
DateProcessResult
April 7, 2009Peer reviewReviewed
October 29, 2009Good article nomineeNot listed
Current status: Former good article nominee

Template:Findsourcesnotice

Contradiction in proof section?

The last paragraph in Four color theorem#Proof by computer: 'They responded that the rumors were due to a "misinterpretation of [Schmidt's] results" and obliged with a detailed article' - without further comment it looks like Schmidt was wrong. But then we learn that their book later " explained and corrected the error discovered by Schmidt [...]", so Schmidt was right? Related question: Why was it "a rumor" years after the master thesis was published? --mfb (talk) 07:22, 16 May 2019 (UTC)[reply]

Requested move 22 August 2020

The following is a closed discussion of a requested move. Please do not modify it. Subsequent comments should be made in a new section on the talk page. Editors desiring to contest the closing decision should consider a move review after discussing it on the closer's talk page. No further edits should be made to this discussion.

The result of the move request was: not moved. (closed by non-admin page mover) Jerm (talk) 03:18, 30 August 2020 (UTC)[reply]


Four color theoremFour-color theorem – Punctuation Electricmaster (talk) 08:39, 22 August 2020 (UTC)[reply]

That would involve switching from American English to English English. As Appel is American and Haken taught in America I think color is the most appropriate spelling to use.--Salix alba (talk): 16:57, 22 August 2020 (UTC)[reply]
Indeed, and since the article title has used the American spelling since its creation, MOS:RETAIN applies. Favonian (talk) 17:01, 22 August 2020 (UTC)[reply]
Two IPs from Sumatra !voting for a switch to British spelling. Fascinating. Favonian (talk) 17:06, 22 August 2020 (UTC)[reply]
Now four IPs from Sumatra, with even more participating on the same request at Talk:Five color theorem. —David Eppstein (talk) 05:44, 23 August 2020 (UTC)[reply]
I've taken the liberty of striking out all but the first of the Sumatran IPs, on the principle that they're obvious puppetry of some sort (meat or socks, don't care which). —David Eppstein (talk) 22:16, 23 August 2020 (UTC)[reply]

OP here. While I personally disagree on keeping the title without hyphenation, I respect the counterarguments and the current democratic consensus. This reminds me of the debate regarding air superiority fighter vs air-superiority fighter. It seems to be a matter of stylistic preference. Thanks for your input. Electricmaster (talk) 10:34, 26 August 2020 (UTC)[reply]


The discussion above is closed. Please do not modify it. Subsequent comments should be made on the appropriate discussion page. No further edits should be made to this discussion.

Simple Proof

On a square grid start with a single square. Add a layer of squares around it so that it becomes a 3x3 square. Each square you add will touch at most 3 other squares, so will only require at most 4 colors to map it. Add layer after layer to infinity, similarly the criterion for 4 colors is met. Is this what was said to be the proof?GuildCompounder (talk) 03:14, 15 December 2020 (UTC)[reply]

You are only colouring a particular map. Most maps don't consist of layers like this. McKay (talk) 04:42, 15 December 2020 (UTC)[reply]
@GuildCompounder: Consider this ball. When you come to adding the last segment, it will touch five segments previously added. Does your method guarantee those five use no more than three colors? --CiaPan (talk) 15:47, 2 March 2021 (UTC)[reply]
The four color theorem only applies to planar maps/graphs. It's well-known (and discussed in the article) that other topologies can need more colors. I don't see the relevance to this section. --mfb (talk) 04:18, 3 March 2021 (UTC)[reply]
Sphere is equivalent to plane, actually. But McKay's original reply is correct -- building from layers of squares doesn't deal with any of the interesting maps. (And of course the observation that it sat unsolved for a century, and then required computer assistance, should be a good indication that any "simple" proof attempt is quite likely to be wrong!) Joule36e5 (talk) 05:47, 3 March 2021 (UTC)[reply]
@Mfb: Yes, other topologies can need more colors. But this is the same topology. If you exclude any point of a sphere (which may be an interior point of any "country" region, hence meaningless in map coloring), then the rest of the sphere is homeomorphic with a plane (see the Stereographic projection for an example of a continuous bijection between a punctured sphere and a plane), so any result of coloring a map on a sphere applies verbatim to a plane and vice versa. --CiaPan (talk) 10:46, 3 March 2021 (UTC)[reply]