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

Polychromatic colouring and cover-decomposition problems in the plane

Add to your list(s) Download to your calendar using vCal

  • UserDömötör Pálvölgyi (University of Cambridge)
  • ClockThursday 26 May 2016, 14:30-15:30
  • HouseMR12.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity