Abstract
We prove a colorful version of Hadwiger’s transversal line theorem: if a family of colored and numbered convex sets in the plane has the property that any three differently colored members have a transversal line that meet the sets consistently with the numbering, then there exists a color such that all the convex sets of that color have a transversal line.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. Bárány: A generalization of Carathéodory’s theorem, Discrete Math. 40(2–3) (1982), 141–152.
I. Bárány and S. Onn: Carathéodory’s theorem, colourful and applicable; in Intuitive geometry (Budapest, 1995), volume 6 of Bolyai Soc. Math. Stud., pages 11–21, János Bolyai Math. Soc., Budapest, 1997.
I. Bárány and S. Onn: Colourful linear programming and its relatives, Math. Oper. Res. 22(3) (1997), 550–567.
J. E. Goodman and R. Pollack: Hadwiger’s transversal theorem in higher dimensions, J. Amer. Math. Soc. 1(2) (1988), 301–309.
G. Kalai and R. Meshulam: A topological colorful Helly theorem, Adv. Math. 191(2) (2005), 305–311.
R. Pollack and R. Wenger: Necessary and sufficient conditions for hyperplane transversals, Combinatorica 10(3) (1990), 307–311.
K. S. Sarkaria: Tverberg’s theorem via number fields, Israel J. Math. 79(2–3) (1992), 317–320.
R. Wenger: A generalization of Hadwiger’s transversal theorem to intersecting sets, Discrete Comput. Geom. 5(4) (1990), 383–388.
Author information
Authors and Affiliations
Corresponding author
Additional information
All authors are partially supported by CONACYT research grant 5040017.
Rights and permissions
About this article
Cite this article
Arocha, J.L., Bracho, J. & Montejano, L. A colorful theorem on transversal lines to plane convex sets. Combinatorica 28, 379–384 (2008). https://doi.org/10.1007/s00493-008-2385-y
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-008-2385-y