Mar 10, 2015: Yanbo Zhang: The story of Ramsey numbers II

March 10, 2015The story of Ramsey numbers II
Room: HB 2AYanbo Zhang
12:30-13:30

Given two graphs F and H, the Ramsey number R(F,H) is the smallest integer N such that, for any graph G of order N, either G contains F as a subgraph, or the complement of G contains H as a subgraph.

 

In this presentation, we give a very brief introduction to the theorems established by Erdős and Szekeres. We calculate some classical Ramsey numbers. Then we introduce our work on graph Ramsey theory. We also present some open problems