How do I prove that the graph with at least 6 vertices or its complement contains a triangle?
Do I have to prove that if a graph contains a triangle, then its complement doesn't contain, and the opposite if its complement contains a triange then a graph doesn't?
So probably the reason this was tagged with 'ramsey-theory' is this section of the wikipedia page :
and then:
Consider, for example the 6-cycle (C6). Obviously it has no triangles - now what is the complement of C6? Try drawing the complete graph on 6 vertices (K6) and coloring it with one color for C6 and another for the rest of the edges (the complement) - does this have a triangle?