On the Minimum Degree of Minimal Ramsey-Graphs

Tuesday, September 9, 2014 - 2:00pm - 2:50pm
Keller 3-180
Tibor Szabó (Freie Universität Berlin)
A graph G is a minimal Ramsey-graph for H if every two-colouring of the edges of G contains a monochromatic copy of H, but no proper subgraph of G has this property. Burr, Erdos and Lovasz investigated the extremal values of various graph parameters among minimal Ramsey-graphs for the clique. In particular they determined the smallest minimum degree of minimal Ramsey-graphs for the k-clique. Recently there has been much activity in extending their investigations in various directions, in the talk I survey some of these.
This represents joint work with Jacob Fox, Andrey Grinshpun, Anita Liebenau, and Yury Person.