Combinatorics and Discrete Probability Seminar
Mathias Schacht
University of Hamburg
Canonical Ramsey numbers for partite hypergraphs
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 $\text{poly}(t)$. This
is joint work with Giovanne Santos and Matias Azocar.
Monday February 17, 2025 at 3:00 PM in 1227 SEO