Cookie Setting MathNet Korea

이전페이지 이동
On the colourful Helly theorem
[2017 Discrete Math 세미나]
Date: 2017-07-07
Speaker : Edgardo Roldán-Pensado (Instituto de Matemáticas, UNAM, Mexico)
Abstract : 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.
Information Center for Mathematical Sciences KAIST
34141 대전광역시 유성구 대학로 291 (구성동373-1)
한국과학기술원(KAIST) 수리과학정보센터
전화 042-350-8196
e-mail :
Copyright (C) 2018. ICMS All Rights Reserved.