Odd coloring

Ponente: Kolja Knauer
Institución: Universidad de Barcelona
Tipo de Evento: Investigación
Cuándo 12/06/2025
de 11:00 a 12:00
Dónde ZOOM ID 882 9372 3602
Agregar evento al calendario vCal
iCal
The odd chromatic number of a graph G is the minimum k such that G admits a proper coloring such that in the neighborhood of every (non-isolated) vertex, some color appears an odd number of times. I will give some overview, results, and problems on the behavior of this parameter in comparison to the usual chromatic number. This is based on different joint works with James Davies, Meike Hatzel, Andrea Jiménez, Carla Negri Lintzmayer, Martín Matamala, Rose McCarty, Juan Pablo Peña, Daniel A. Quiroz, Maycon Sambinelli, Torsten Ueckerdt, Yoshiko Wakabayashi, Weiqiang Yu, and José Zamora.