Date
Tue, 14 Jun 2016
14:30
Location
L6
Speaker
Endre Csóka
Organisation
Budapest

We purify and generalize some techniques which were successful in the limit theory of graphs and other discrete structures. We demonstrate how this technique can be used for solving different combinatorial problems, by defining the limit problems of the Manickam--Miklós--Singhi Conjecture, the Kikuta–Ruckle Conjecture and Alpern's Caching Game.

Please contact us with feedback and comments about this page. Last updated on 04 Apr 2022 15:24.