Limits of some combinatorial problems

Add to your list(s) Download to your calendar using vCal

• Endre Csóka (Rényi Institute)
• Thursday 02 June 2016, 14:30-15:30
• MR12.

If you have a question about this talk, please contact Andrew Thomason.

We refine 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.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.