09-07-2004, 19:46
|
#11
|
|
Dr Pepper Addict
Join Date: Oct 2003
Location: Nottingham
Age: 50
Services: VM Phone : Sky+ Multiroom : VM Cable (50 Mbps)
Posts: 18,686
|
Re: Tricky Triangle Question?
Quote:
|
Originally Posted by Jerrek
You can't... You're esentially turning this into a bipartite graph. Using elementary combinatorics, it can be proven that this graph can't be turned into a bipartite graph because the total number of edges in conjunction with the 5 vertices requires a tripartite graph to exist.
You can even apply the 2-color, or 3-color theorem to this graph.
|
Just what I was thinking 
|
|
|