https://en.wikipedia.org/wiki/Ramsey%27s_theorem#Example:_R(3,_3)_=_6 https://en.wikipedia.org/wiki/Ramsey%27s_theorem#Example:_R(... Let the 6 nodes be users,

https://en.wikipedia.org/wiki/Ramsey%27s_theorem#Example:_R(3,_3)_=_6 https://en.wikipedia.org/wiki/Ramsey%27s_theorem#Example:_R(... Let the 6 nodes be users, and color edges between two users red if they are friends, blue if they are not. I think it's true as stated, as another comment claims.