The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: A Simple Proof of The Four Color Theorem
Replies: 10   Last Post: Jul 3, 2013 6:36 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 12,067
Registered: 7/15/05
Re: A Simple Proof of The Four Color Theorem
Posted: Jul 3, 2013 3:01 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

bill wrote:
>quasi wrote:
>>bill wrote:
>>>Why do we expect Kempe's strategy to succeed on the first trial
>>>when no other method is under the same restrictions?

>>Because Kempe's proof claimed that his coloring strategy would
>>_always_ produce a 4-coloring. Kempe's proof said nothing about
>>multiple trials (whatever that means). Thus, Kempe's proof was
>> flawed.

>The original coloring is C1,

Why does there have to be an original coloring? Does Kempe's
presuppose an initial coloring? If not, why isn't Kempe's
claimed coloring the first and final one?

>The first application of Kempe resulted in C2.
>The application of Kempe's strategy to coloring C2
>would produce coloring C3.

How does Kempe's strategy depend on the prior coloring?

>If C3 is not a proper 4-coloring; then C4 will be next
>If not C4, then C5, then C6 ... Coo.
>Each successive coloring represents a "trial".

I don't really understand how the colorings

C_1,C_2,C_3, ...

evolve. But regardless, what guarantees that some C_k is
a 4-coloring?

>For each basic coloring there are 4 sub-colorings as
> A
> B 0 B
> D C
>Vertex 0 can be assigned the color A or C or D
>or not be assigned any color.

I have no idea what the above represents.

But in any case, my previous objection still stands:

You would have to _prove_ that for _all_ possible
counterexamples to Kempe's coloring strategy (not just the
counterexample Heawood supplied), your revised strategy
manages (after finitely many trials) to achieve a 4-coloring.


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.