Assertion: complete graph | /r/HasProperty | monochromatic triangle
Facets:
Source sentences:
text: A simple example is the friendship theorem, which states that in any coloring of the edges of K 6 {\displaystyle K_{6}} , the complete graph of six vertices, there will be a monochromatic triangle; often illustrated by saying that any group of six people either has three mutual strangers or three mutual acquaintances.