For example, consider a complete graph of order "n"; that is, there are "n" vertices and each vertex is connected to every other vertex by an edge. A complete graph of order 3 is called a triangle. Now colour every edge red or blue. How large must "n" be in order to ensure that there is either a blue triangle or a red triangle? It turns out that the answer is 6. 