Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Monday, July 16, 2012, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Jan Foniok (Queen's University)
I will talk about Ramsey properties of classes of digraphs (or more generally, relational structures) defined by forbidding homomorphisms from a fixed set of digraphs. Cases with infinitely many forbidden structures are of particular interest, especially if the forbidden “obstructions” are all trees or have bounded treewidth. These classes have several interesting applications, in areas such as complexity theory of constraint satisfaction problems.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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