Re: Four Color Theorem.
- From: Gerry Myerson <gerry@xxxxxxxxxxxxxxxxxxxxxxxxx>
- Date: Tue, 26 Jul 2005 11:54:11 +1000
In article <1122341617.557618.299500@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
b92057@xxxxxxxxx wrote:
> Rule 1 merely states a condition that must exist if the graph is
> 5-partite. A graph can be 5-C if and only if it is 5-partite!
Nonsense. The cycle on 5-vertices is 5-colorable. It is also
4-colorable, and 3-colorable, but not 2-colorable.
> My intention is to understand exactly what is necessary to prove
> the 4CT.
Do you mean that you want to understand exactly what hypotheses
are necessary for the conclusion of the 4CT to hold? or do you
mean you want to understand exactly what the mathematical steps
are in the proof of the 4CT?
If the former, I repeat my comment that the hypotheses can be
found in any number of places where the theorem is stated.
If the latter, that's a lot harder, but there are some useful
expositions of the proof out there.
--
Gerry Myerson (gerry@xxxxxxxxxxxxxxx) (i -> u for email)
.
- Follow-Ups:
- Re: Four Color Theorem.
- From: b92057
- Re: Four Color Theorem.
- References:
- Four Color Theorem.
- From: b92057
- Re: Four Color Theorem.
- From: Gerry Myerson
- Re: Four Color Theorem.
- From: b92057
- Four Color Theorem.
- Prev by Date: Re: Self Study problem help - Group theory
- Next by Date: Re: System of even and odd integers
- Previous by thread: Re: Four Color Theorem.
- Next by thread: Re: Four Color Theorem.
- Index(es):
Relevant Pages
|
