Alexandr V. Kostochka, On Ramsey-type problems for paths and cycles in dense graphs
A well-known Ramsey-type puzzle for children is to prove that among any 6 people either there are 3 who know each other or there are 3 who do not know each …
1 event found.