Question 847372: Connet all the vertices with 2 colours, such that there exists no triangle with all 3 sides of the same colour. (Triangles not connected by vertices on each point do not count) If this is impossible, please explain, or prove why.
The vertices are arranged as such:
⠀•⠀⠀•
•⠀⠀⠀⠀•
⠀•⠀⠀•
Each line should connect to every vertice to each other. There should be 20 triangles.
Answer by richard1234(7193)   (Show Source):
You can put this solution on YOUR website! You're coloring six points, no three of which are collinear, with two colors. That means there will be three points with the same color, and hence a triangle with all vertices having that color. Therefore it is impossible.
|
|
|
