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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹī¸ Information

Hypergraph Ramsey numbers

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Type the title of a new list herecircle Live Zoom webinar, followed by Q&A session Computer Laboratory NetOS Group Talklets

Other talks

How Far Can Good Go Without God? The Limits of a Naturalistic Ethic Title to be confirmed Kirk Public Lecture: Title TBC Afternoon Break The Inaccessible Game title abstract tbc
 

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