Campus Event Calendar
Event Entry
What and Who
Computing Small Ramsey Numbers
Pascal Schweitzer
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 13 July 2007
13:30
30 Minutes
E1 4
024
Saarbrücken
Abstract
The Ramsey number R(k,l) is the smallest integer n for which any 2-coloring (say red and blue) of a complete Graph G of size at least n will form a monochromatic red clique of size k or a monochromatic blue clique of size l. The Computation of small Ramsey numbers is notoriously difficult, for example the number R(4,6) is only known to lie in the range from 35 to 41.
I will present a possibly promising approach for the computer aided computation of small Ramsey numbers.
Contact
Pascal Schweitzer
--email hidden
passcode not visible
logged in users only
Pascal Schweitzer, 07/10/2007 18:24
Pascal Schweitzer, 07/10/2007 18:24 -- Created document.
Pascal Schweitzer, 07/10/2007 18:24 -- Created document.