Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Theory of Combinatorial Algorithms
Prof. Emo Welzl and Prof. Bernd Gärtner
Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Common transvrsals for intersecting planar families of translates of a
convex set.
Meir Katchalski, Technion - Israel Institute of Technology
We prove with Krivelevich and Saks a result on finite planar families of convex sets in the plane with the property that the intersection of any k members of the family have empty intersection: There exists a positive integer m such that any such family admits a common transversal provided that all its subfamilies of cardinality mk or less admit a common transversal. (A common transversal for a family is a straight line that intersects every member of the family).
Back
