University of Cambridge > Talks.cam > Combinatorics Seminar > Limits of some combinatorial problems

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Limits of some combinatorial problems

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Small Lecture Theatre, Ray Dolby Centre and on Zoom: https://zoom.us/j/92447982065?pwd=RkhaYkM5VTZPZ3pYSHptUXlRSkppQT09 Cambridge Global Food Security Bateman Auditorium, Gonville & Caius College, Trinity Street, Cambridge, CB2 1TA

Other talks

Morning Break Wolfson Tool Factory Reproducibility In Astrophysical Simulations: The AGORA Initiative and a 14-Year Human Experiment (In Memory of Joel Primack) Topology of the Ritz energy landscape Early cancer clinical trials Scientific Steering Committee meeting
 

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