today my mathematic's lecturer asked me following question proof that if in 6 man,there is not possible to search such 3 man who knows each other,then there always could be found such 3 man who does
not know each other
firstly i was thinking that it was identity,(like 5=5)but then he said to me considering this problem using graph (6 vertices),i was trying today to draw such graph and get counterexample,i have considered that 3 man know each other if there are connected by same color edge and is created triangular form,but i dont understand if it is theorem then why i got opposite?thanks a lot