Limits of Some Combinatorial Problems

14 June 2016
14:30
Endre Csóka
Abstract

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.

  • Combinatorial Theory Seminar