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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, November 23, 2006, 12:15 pm

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

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

**Speaker**: Reto Spöhel

Consider the following problem: Find a coloring of the edges of the random graph $G_{n,p}$ with $k$ colors such that there is no monochromatic copy of some fixed graph $F$. Rödl and Rucinski (1995) proved a general threshold function $p_0(F,n)$ for the existence of such a coloring Their proof was, however, non-constructive.

Kohayakawa and Kreuter (1997) conjectured a general threshold formula for the asymmetric case, where a different graph $F_i$ is forbidden in every color $i$, $1\leq i\leq k$. They verified it for the case when all graphs involved are cycles, but all other cases have remained open.

We address the case when all graphs involved are cliques and propose an algorithm that a.a.s. finds a valid $k$-edge-coloring of $\Gnp$ when $p$ is below the conjectured threshold. This algorithm can be also adjusted to produce a valid $k$-coloring in the symmetric case.

Joint work with Martin Marciniszyn, Jozef Skokan, and Angelika Steger.

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