Hypergraph Ramsey numbers

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

• David Conlon
• Friday 05 December 2008, 14:00-15:00
• MR4, CMS, Wilberforce Road, Cambridge, CB3 0WB.

If you have a question about this talk, please contact Anton Evseev.

Let H be a k-uniform hypergraph. The Ramsey number r(H) is the smallest number n such that in any two-colouring of the edges of the complete k-uniform hypergraph K_n, there is guaranteed to be a monochromatic copy of H. We will discuss various new bounds for hypergraph Ramsey numbers and related problems. This is joint work with Jacob Fox and Benny Sudakov.

This talk is part of the Junior Algebra and Number Theory seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• Junior Algebra and Number Theory seminar
• MR4, CMS, Wilberforce Road, Cambridge, CB3 0WB
• School of Physical Sciences
• bld31
• ndb35's list

Note that ex-directory lists are not shown.