Alexandr V. Kostochka, On Ramsey-type problems for paths and cycles in dense graphs
Room 1501, Bldg. E6-1, KAISTA 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 other. More generally, a graph $G$ arrows a graph $H$ if for any coloring of the edges of $G$ with two colors, there is a …