Anita Liebenau (FU Berlin)

2010/12/03, 12:30

Before the BMS Friday Colloquium by Prof. Joel Spencer

Before the BMS Friday Colloquium by Prof. Joel Spencer

Urania Berlin, at the BMS Loft (3rd floor)

To give an idea of the power of probabilistic arguments in graph theory, I will show two results of different flavour. The first comprises the statement that for an arbitrary graph G there a is partition of the vertices such that the resulting bipartite graph has at least half the number of edges of G. For the second, I will introduce the random graph model G(n,p) and the notion of a threshold function. We will then take a short look at the property of having isolated vertices.

Hopefully, this will pave the way to a better understanding of the talk by Joel Spencer for people from outside the area.