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, April 07, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Frank Mousset

The probability that G(n,p) is triangle-free

I will talk about how one can determine asymptotically the probability that G(n,p) with p=o(n^{-1/2}) does not contain any triangles. The solution for p=o(n^{-2/3}) was given by Wormald in the 90s (following earlier work by Erdös and Rényi and Janson, Luczak and Rucinski). In this range, the answer is of the form exp(-A+B-C), where the terms A, B, and C correspond in a rather nice way to dependencies between one, two, and three triangles. Recently, we noticed that such a nice description can be given over the whole range p=o(n^{-1/2}). Our observation also applies in the more general setting of Janson's inequality, provided that certain natural conditions are met. The talk is based on joint work with A. Noever, K. Panagiotou, and W. Samotij.

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