In graph-theory Erdos Posa theorems correspond to the results of the following typeFor every positive integer $k$, either a graph has $k$ vertex disjoint structures or has a $f(k)$ sized vertex subset which intersects every structure. For an example, take cycles or grids in graph as structure. In this talk we will see origin to some of these results and will also see some of the modern development.
