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: Tuesday, March 01, 2011, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Jan Foniok

On Ramsey classes of structures

The classical Ramsey theorem (1930) asserts that for any positive integers a, b and any number of colours r, there is a number c such that no matter how we colour all a-element subsets of {1,...,c}, there will always be a b-element subset whose a-subsets all have the same colour.

This theorem has a structural generalisation: We colour subgraphs (or substructures) of C isomorphic to a given graph A, and want to find a subgraph isomorphic to B. There is a strong link to amalgamation classes and Fraïssé limits.

I will talk about results achieved about 5 years ago jointly with J. Böttcher, and about what I've learnt and done during my first four weeks in Paris.

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