Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Computing Small Ramsey Numbers
Speaker:Pascal Schweitzer
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Friday, 13 July 2007
Duration:30 Minutes
Building:E1 4
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.

Name(s):Pascal Schweitzer
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
  • Pascal Schweitzer, 07/10/2007 06:24 PM
  • Pascal Schweitzer, 07/10/2007 06:24 PM -- Created document.