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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, September 23, 2008, 12:15 pm

**Duration**: This information is not available in the database

**Location**: OAT S15/S16/S17

**Speaker**: Luca Gugelmann

Consider the following game on an initially hidden random graph G_{n,p}: in each step r vertices are revealed together with all edges leading to previously revealed vertices. The player has r colors at her disposal and must assign a different color to each of the newly revealed vertices. The player wins if she manages to color all n vertices without creating a monochromatic copy of some fixed graph F. We prove an upper bound p_0(r,F,n) such that for p >> p_0 the player cannot avoid creating a monochromatic copy of F with probability tending to 1 for n tending to infinity, regardless of the chosen strategy. We believe this bound is tight in the sense that there is a strategy for the player such that for all p << p_0 she wins with probability tending to 1 for n to infinity.

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