## Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

# Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

 Mittagsseminar Talk Information

Date and Time: Tuesday, November 02, 2010, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Anna Gundert

## Connectivity of Random 2-Complexes

Graphs in which the edges are added in a random fashion have been studied for a long time. More recently, higher dimensional analogues have been considered, for example the Linial-Meshulam model for random 2-complexes. Here, triangles are added independently with probability $p$ to the complete graph on $n$ vertices. For random graphs, it is a classical result that the threshold for connectivity is $\log n / n$. We will look at similar results for the Linial-Mesulam model in dimension 2. Whereas for graphs there is only one notion of connectivity, there are several distinct notions in higher dimensions. We will explore these, in a rather combinatorial (and hopefully not too topological) manner, and see what is known about the connectivity of these random 2-complexes

Information for students and suggested topics for student talks