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.

computational geometrydiscrete mathematicscommutative algebracombinatorics

Audience: researchers in the topic

Copenhagen-Jerusalem Combinatorics Seminar

Series comments: There is a mailing list for talk announcements. If you want to receive the announcements, send an e-mail to the organizer to subscribe to the mailing list.

The password for the zoom room is 123456