Combinatorics Seminar - Miloš Trujić

16:15-18:00

Speaker: Miloš Trujić

Title: Two problems in (size-)Ramsey theory

Abstract: In 1978, Erdős, Faudree, Rousseau, and Schelp introduced the study of the size-Ramsey
number of a graph H, defined as a minimum positive integer m for which there exists a
graph G with m edges such that in every colouring of its edges by two colours there is a
monochromatic copy of H. I will discuss recent advances for two problems in this area when
H is a large graph of bounded maximum degree. This is joint work with David Conlon and
Rajko Nenadov.