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

Date and Time: Thursday, October 21, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Alexander Engström (KTH Stockholm)

Evasive Graph Properties

Given a graph property, and a graph G, one can decide if G has the property by asking questions, "is (x,y) an edge of G?". If an algorithm asks the questions in a clever order, it may be able to decide if G has the property without asking about all pairs of vertices.

On the other hand, for some graph properties, there is no such algorithm. Whatever algorithm one tries, there is a graph which forces the algorithm to ask about all pairs of vertices. Such properties are called evasive.

The most rewarding methods to determine which properties are evasive, are from topological combinatorics. We will survey some of these methods, and talk about current trends and results.

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

Previous talks by year:   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