Mirkó Visontai: Graph assembly or how to organize a party
Mirkó Visontai, KTH
Tid: Fr 2013-05-17 kl 14.15 - 15.15
Plats: Room 3721, Lindstedtsvägen 25, 7th floor, Department of Mathematics, KTH
In this talk, I will discuss the abstract version of a very applicable problem, namely,
How to invite people to your party in a way that everyone will show up?
Although, I will touch on topics such as graphs, NP-completeness, and even matroids I will try to make the presentation self-contained. This is based on joint work S. Angelov and S. Khanna.
Please observe that the unusual time!