Suppose there are several points in space, where any 4 points are not coplanar, and some pairs of points are connected by line segments, forming a graph. If at least colors are needed to color these points so that each point is colored with one of the colors, and no two connected points share the same color, then this graph is called an -colorable graph. Prove that for any , there exists an -colorable graph that does not contain a triangle.