Usted está aquí: Inicio / Actividades / Seminarios / Seminario Preguntón de Matemáticas Discretas / Actividades / Unavoidable colorful patterns

Unavoidable colorful patterns

Ponente: Alp Müyesser
Institución: Carnegie Mellon University
Tipo de Evento: Investigación
Cuándo 05/02/2019
de 17:00 a 18:00
Dónde Centro Académico Cultural, aula A1
Agregar evento al calendario vCal
iCal

Ramsey's theorem roughly states that any graph on sufficiently many vertices will contain a large monochromatic pattern. Here, we investigate the emergence of multicolored patterns under the assumption that all colors in the host graph are well-represented. 
This is a joint work with Matt Bowen and Ander Lamaison.