Friday, November 3, 2017 - 15:00
1 hour (actually 50 minutes)
The search for the asymptotics of the Ramsey function R(3,k) has a long and fascinating history. It begins in the hill country surrounding Budapest and winding over the decades through Europe, America, Korea and Rio de Janiero. We explore it through a CS lens, giving algorithms that provide the various upper and lower bounds. The arguments are various more or less sophisticated uses of Erdoes Magic and, indeed, many of the most important advances in the Probabilistic Method have come from these investigations.