Usted está aquí: Inicio / Actividades / Seminarios / Seminario Preguntón de Matemáticas Discretas / Actividades / Identification problems in (hyper)graphs

Identification problems in (hyper)graphs

Ponente: Florent Foucaud
Institución: LIMOS, Clermont-Ferrand, Francia
Tipo de Evento: Investigación
Cuándo 06/12/2017
de 11:30 a 13:00
Dónde Unidad Multidisciplinaria de Docencia e Investigación (UMDI), Aula 2. UNAM Campus Juriquilla, Querétaro
Agregar evento al calendario vCal
iCal

We will introduce the audience to the topic of certain types of identification problems in hypergraphs (with a focus on graphs). One of the oldest results in the area is a celebrated theorem of Bondy from 1972. In these types of problems, we wish to choose a subset of elements that "covers" the (hyper)graph in such a way that all (remaining) elements are "identified" (i.e. uniquely determined) by our choice. Several definitions will be considered, and a selection of recent advances will be presented.