Assertion: triangle's vertex | /r/HasProperty | colored red
Facets:
Source sentences:
text: : if the edges of a complete graph on Ω ( t 2 log ⁡ t ) {\displaystyle \Omega ({\tfrac {t^{2}}{\log t}})} vertices are colored red and blue, then either the red graph contains a triangle or, if it is triangle-free, then it must have an independent set of size t corresponding to a clique of the same size in the blue graph.