Dear participants,

I will give a seminar on new proof on improved bounds on grid minor theorem, that is: If a graph has tree-width at least f(k) then it contains k by k grid as a minor.

In a first half I will give an informal overview of the technique of the proof and after a break a part of the proof will be presented.

Best, Dusan