MATH Seminar

Title: Canonical Ramsey numbers for partite hypergraphs
Seminar: Combinatorics
Speaker: Mathias Schacht of
Contact: Liana Yepremyan, liana.yepremyan@emory.edu
Date: 2024-12-03 at 4:00PM
Venue: MSC E408
Download Flyer
Abstract: We consider quantitative aspects of the canonical Ramsey theorem of Rado for k-partite k-uniform hypergraphs. For the complete bipartite graph $K_{t,t}$ it was recently shown by Dobak and Mulrenin that these numbers grow exponential in $t-log(t)$ and considering random edge colourings shows that this bound is asymptotically optimal. We extend this result to k-uniform hypergraphs and obtain a bound exponential in $poly(t)$. This is joint work with Giovanne Santos and Matias Azocar