Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, January 05, 2012, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Jan Foniok (Queen's University)
I don't really know what to say, so I will talk about some Ramsey theorems. After saying that they are just about the chromatic number of some hypergraph but that no Ramsey theorems can ever be proved by hypergraph-colouring theorems, I will show a Ramsey theorem proved by a hypergraph-colouring theorem. Afterwards I will discuss the paper [Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems by A. Atserias and M. Weyer], where a Ramsey-type theorem is applied to a question related to the complexity of constraint satisfaction problems. The first part is joint work with Manuel Bodirsky.
Automatic MiSe System Software Version 1.4803M | admin login