Loading Events

Ramsey’s Theorem: A Belated Halloween Special by Francesca Eluhu ’19, Mathematics Colloquium, November 12

Monday, November 12th, 2018
1:00 pm
- 1:45 pm

  • This event has passed.

Ramsey’s Theorem: A Belated Halloween Special by Francesca Eluhu ’19, Mathematics Colloquium, November 12, 1 – 1:45 pm, Stetson Court Classroom 101

Abstract:  In 1928, Frank P. Ramsey conjectured that for any large enough graph, there is an independent set of size s or a clique of size t. The smallest number of vertices required to achieve this is called a Ramsey number. In this graph theory talk, we will examine implications of Ramsey’s theorem, analyze Ramsey numbers and discuss why the precise value of so many Ramsey numbers are still left to be conjectured.

Event/Announcement Navigation

Related Events