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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

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

Mittagsseminar Talk Information

Date and Time: Tuesday, June 15, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Dieter Mitsche

Reconstructing a Large Clique in a Random Graph

In 1998 Alon, Krivelevich and Sudakov showed how to find a clique of size k=c √n in a random graph G(n,1/2,k), which is generated in the following way: add each edge with probability 1/2 independently, then choose a random subset Q of size k and force it to be a clique by joining each pair of vertices of Q with an edge.

This talk generalizes the problem of reconstructing a clique in the G(n,p,q,k) model: choose a random subset Q of size k; each edge incident to two vertices of Q is included with probability p, each other edge is included with probability q, where p > q.

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