Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, January 05, 2012, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Jan Foniok (Queen's University)

Some Ramsey applications

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login