Monochromatic Triangle Problem

MONOCHROMATIC TRIANGLE PUZZLE !!!

Suppose 6 people are gathered together; then either 3 of them are mutually acquainted or 3 of them are mutually unacquainted.

Color an edge red if the people represented by its endpoints are acquainted, and green if they are not acquainted.

Any choice of 3 vertices defines a triangle; here, in this game we try to show that either there is a red triangle

or a green triangle.

That is there must exist either a RED or a GREEN MONOCHROMATIC TRIANGLE.

This game is a simple case of the famous Ramsey Theorem.

The number 6 in this example is special i.e. with 5 or fewer vertices it is not true that there must be a monochromatic triangle, and with more than 6 vertices it is true.

Vertices are numbered 0,1,2 etc.

First click on any vertex say v1 and then click on vertex v2, vertex v1 and v2 will be joined by a RED or GREEN line .

The game will be over when there will be a RED or GREEN monochromatic triangle.

This game is ABSOLUTELY FREE, has NO ADS or NO IN-APP PURCHASES.

In case of any logical bug or misinformation, please email me.