perplexus.info :: Logic : Mutually friendly

Home > Logic

Mutually friendly (Posted on 2002-07-01)

Prove that any group of six people contains either 3 mutual friends or 3 mutual strangers.

(For the purpose of this problem any pair of people must be either friends or strangers.)

See The Solution Submitted by levik

Rating: 3.0000 (5 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

Ramsey Theory

| Comment 6 of 11 |

if you are interested in further problems of this type, look up Ramsey Theory.

Posted by Josh Myer on 2002-11-15 05:11:33

Please log in:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info