voltarData: 15/12/2021
Título: On some extremal problems.
Palestrante: Margarita Akhmejanov, Moscow Institute of Physics and Technology.
Data: 15 de Dezembro de 2021, 16 h.
Sala: Google Meet.
Resumo: In this talk I will briefly describe some problems we are working on in our Moscow Lab of Janos Pach. In particular, I’ll tell about Weak saturation number of bipartite graphs K_{s,t}
Chip game and on-line hypergraph coloring: An interesting version of the problem of hypergraph coloring is the on-line coloring. Within this setting vertices are presented on-line, one by one, each vertex v together with indices of all edges that contain v. A color for v needs to be assigned immediately and can not be changed later. The goal is to avoid monochromatic edges.
Max-norm Ramsey Theory: https://arxiv.org/pdf/2008.02008.pdf, https://arxiv.org/pdf/2111.08949.pdf For two metric spaces X and Y, the chromatic number of Xwith forbidden Yis the smallest rsuch that there is a coloring of the points of X with r colors and no monochromatic copy of Y. It was shown that for each finite metric space M that contains at least two points \chi(R_infinity^n, M) grows exponentially with n.
Veja: Vídeo