Endre Csóka: Limits of some combinatorial problems

Speaker: Endre Csóka

Title:  Limits of some combinatorial problems

Abstract: We show some new examples on how limit theory of combinatorial structures can help solving combinatorial problems. First, we generalize the Manickam-Miklós-Singhi Conjecture, using limit theory. Then we introduce two limit problems of Alpern's Caching Game, that are good approximations of the finite game when some parameters tend to infinity. With the use of these limit problems, we show a surprising result which disproves some conjectures about the finite problem.