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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Polychromatic colouring and cover-decomposition problems in the plane

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Fiber Optic Jobs Careers Room 326, Raised Faculty Building, MML, Sidgwick Avenue, Cambridge, CB3 9DA Paston Brown Room, Homerton College, Hills Road, Cambridge, CB2 8PH

Other talks

Director's Welcome Climate, uncertainty, and the slippery measurement of Antarctic ice Title to be confirmed Evolution: Inevitable or Remarkable? A scientists guide to the art of radiation therapy and Neurosurgery for the oncologist Polar Oceans Seminar Talk
 

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