Apr. 20, 4:30pm, Porter Hall 226A (Note unusual day, time, and location)

David Conlon, University of Oxford

On the Erdős–Gyárfás problem in generalised Ramsey theory

David Conlon, University of Oxford

On the Erdős–Gyárfás problem in generalised Ramsey theory

Abstract:

Fix positive integers *p* and *q* with *2* ≤ *q* ≤ binom(p,2). An edge-colouring of the complete graph *K _{n}* is said to be a (

We also discuss some related questions.

Joint work with Jacob Fox, Choongbum Lee and Benny Sudakov.