Ramsey problem: 3 people in 6 pairwise knowing or strangers
by adityaguharoy, Jan 19, 2018, 11:57 AM
Given any collection of
people. Prove that there is either a collection of
people among them such that they know each other pairwise, or there is a collection of
people among them who are pairwise strangers.
Proof
In the language of arrows



Proof
Let the
people be
.
Fix any one of them say
.
Consider the relation between
and the other
people.
By Pigeonhole Principle
must know at least
of them or be stranger to at least
of them.
Without loss of generality let
know
of them.
Let
know
.
Now, consider the relationship pairwise among
.
If, they are pairwise strangers then
is a set of
pairwise strangers.
And if they are not pairwise strangers then at least two of them must know each other.
Let,
and
know each other.
Then, observe that
is a set of
people who know each other pairwise.
Done !!


Fix any one of them say

Consider the relation between


By Pigeonhole Principle



Without loss of generality let


Let


Now, consider the relationship pairwise among

If, they are pairwise strangers then


And if they are not pairwise strangers then at least two of them must know each other.
Let,


Then, observe that


Done !!
In the language of arrows
We state this in the language of arrows as
.
