Tuesday, December 19, 2023 @ 4:30 PM - 5:30 PM KST Shengtong Zhang (张盛桐), Triangle Ramsey numbers of complete graphs Room B332 IBS (기초과학연구원) A graph is H-Ramsey if every two-coloring of its edges contains a monochromatic copy of H. Define the F-Ramsey number of H, denoted by rF(H), to be the minimum number … Continue Reading