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: Thursday, November 30, 2023, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Yuval Wigderson

Ramsey properties of random graphs

A basic result of probabilistic combinatorics, originally due to Erdős and Rényi, is the determination of the threshold at which the random graph G(n,p) contains a triangle with high probability. But one can also ask more refined versions of this question, where we ask not just for one triangle but for many triangles which interact in complicated ways. For example, what is the threshold at which we can no longer partition G(n,p) into two triangle-free subgraphs?

Such questions are the subject of Ramsey properties of random graphs, and a very general conjecture of Kohayakawa and Kreuter predicts an answer to all such questions. In this talk, I will discuss the history of these problems, and present recent progress which proves the Kohayakawa–Kreuter conjecture in almost all cases.

Joint work with Eden Kuperwasser and Wojciech 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