Dear colleagues,

let me invite you to the doctoral seminar on this Thursday at 9:50 in S6. Pavel Veselý will present a paper:

Massimo Lauria, Pavel Pudlák, Vojtěch Rödl, Neil Thapen: The complexity of proving that a graph is Ramsey [1]

With best regards, Honza

[1] http://arxiv.org/abs/1303.3166