Colorings and homomorphisms for graphs and finite structures
Speaker:
Jaroslav Nesetril, Charles University
Date and Time:
Wednesday, June 29, 2011 - 1:30pm to 3:00pm
Abstract:
This course will cover the following topics:
1. Homomorphisms and colorings (sparse incomparability lemma, extension theorem and its relevance to CSP, old and new conjectures)
2. Classes of graphs and structures (4 basic types of classes and their relevance to CSP and model theory)
3. Homomorphism order (the homomorphism order and its properties, limit order)
4. Dualities in many of its forms (characterization of finite dualities, characterization of restricted dualities).