All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General
Ten Colors (Posted on 2004-03-05) Difficulty: 3 of 5
Albinia consists of two states: Alexton and Brighton. Each road in Albinia connects two towns from Alexton and Brighton respectively. It is known that no town is connected with more than 10 others.

Prove that it is possible to color all roads in Albinia, using 10 colors, in such a way that no two adjacent roads would be the same color (we call two roads adjacent if they leave the same town).

No Solution Yet Submitted by Aaron    
Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Question Question for Aaron | Comment 2 of 6 |

Um....never mind...Two roads are adjacent if they leave the same town.....


Are we to assume that Alexton and Brighton are neat and tidy divisions of Albinia ? Because if I were allowed to "gerrymander" Albinia wildly enough into odd shaped fragments, and then arbitrarily unite the fragments into two states Alexton and Brighton, I'm pretty sure I could come up with a map that would not permit your puzzle's hypothesis.    

Edited on March 5, 2004, 5:46 pm
  Posted by Penny on 2004-03-05 11:18:44

Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information