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: Note to Quasi from Bill
Replies: 1   Last Post: Jun 21, 2013 5:39 AM

Advanced Search

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

Posts: 1,187
Registered: 4/18/05
Note to Quasi from Bill
Posted: Jun 20, 2013 7:38 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

I don't seem to be able to post a reply or contact google for help. So I am answering your comments in a separate post.
My comments are indented.

What are MA vertices?

mutually adjacent vertices.

Then connect vertex 5 to each of the first four.


Any non-complete graph with 5 vertices is 4-colorable.
Not if the graph is non-planar.

If there are no forceable sets of four vertices the graph must be 4 colorable.

Except that I've already shown you a counterexample.

Is your example planar?

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.