University of Cambridge > > Junior Algebra and Number Theory seminar > Hypergraph Ramsey numbers

Hypergraph Ramsey numbers

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

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.

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