COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Combinatorics Seminar > Polychromatic colouring and cover-decomposition problems in the plane

## Polychromatic colouring and cover-decomposition problems in the planeAdd to your list(s) Download to your calendar using vCal - Dömötör Pálvölgyi (University of Cambridge)
- Thursday 26 May 2016, 14:30-15:30
- MR12.
If you have a question about this talk, please contact Andrew Thomason. Is it true that given a finite point set on a sphere and a set of halfspheres, such that the set system that they induce on the point set is a Sperner family, we can select a subset of the points that meet every halfsphere in at least one but at most two points? I don’t know the answer to this question (waiting to be solved by YOU !), but I know that the above holds in the plane if instead of halfspheres we take (pseudo)halfplanes. I will talk about consequences of similar results in polychromatic colouring and cover-decomposition, and also mention several other open problems. This talk is part of the Combinatorics Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsPart III Seminar Series Michaelmas 2012 The Globalization of Music: Origins, Development, & Consequences, c1500–1815 Clare College Student Investment Fund## Other talksNew micro-machines, new materials Lipschitz Global Optimization MicroRNAs as circulating biomarkers in cancer The microenvironment in the myeloid malignancies Finding meaning in English writing Requirements in Application Development |