On the colourful Helly theorem

Edgardo Roldán-Pensado

Instituto de Matemáticas, UNAM, Mexico

Instituto de Matemáticas, UNAM, Mexico

2017/07/07 Fri 4PM-5PM

Let F be a family of convex sets in R^d coloured using d+1 colours. Lovasz’s Colourful Helly Theorem states that if any colourful subfamily of convex sets is intersecting, then one of the monochromatic families is intersecting. We study what happens with the rest of the families.