University of Cambridge > > Combinatorics Seminar > Limits of some combinatorial problems

Limits of some combinatorial problems

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

  • UserEndre Csóka (Rényi Institute)
  • ClockThursday 02 June 2016, 14:30-15:30
  • HouseMR12.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity