Canonical colourings in random graphs.

Abstract: The canonical Ramsey theorem of Erdős and Rado impliesthat for a given graph H, if n is sufficiently large then any colouring of the edges of K_n gives rise to copies of H that exhibit certain colour patterns, namely monochromatic, rainbow or lexicographic. I will discuss recent results on the threshold at which the random graph G(n,p) inherits the canonical Ramsey properties of K_n.

Date: Jan 16, 2025 at 10:00:00 h
Venue: Sala de Seminario John Von Neumann, CMM, Beauchef 851, Torre Norte, Piso 7.
Speaker: Guilherme Motta
Affiliation: University of Sao Paulo, Brasil
Coordinator: Matías Pavez
More info at:
Event website
Abstract:
PDF

Posted on Jan 14, 2025 in Seminario de Grafos, Seminars