Abstract
A geometric graph is a graph drawn in the plane such that its edges are closed line segments and no three vertices are collinear. We settle an old question of Avital, Hanani, Erdős, Kupitz, and Perles by showing that every geometric graph withn vertices andm>k 4 n edges containsk+1 pairwise disjoint edges. We also prove that, given a set of pointsV and a set of axis-parallel rectangles in the plane, then either there arek+1 rectangles such that no point ofV belongs to more than one of them, or we can find an at most 2·105 k 8 element subset ofV meeting all rectangles. This improves a result of Ding, Seymour, and Winkler. Both proofs are based on Dilworth’s theorem on partially ordered sets.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
M. Ajtai, V. Chvátal, M. Newborn, and E. Szemerédi: Crossing-free subgraphs,Ann. Discrete Math. 12 (1982), 9–12.
N. Alon and P. Erdős: Disjoint edges in geometric graphs,Discrete Comput. Geom. 4 (1989), 287–290.
S. Avital and H. Hanani: Graphs,Gilyonot Lematematika 3 (1966), 2–8 (in Hebrew).
Th. H. Cormen, Ch. E. Leiserson, and R. L. Rives:Introduction to Algorithms, MIT Press, Cambridge, MA, and McGraw-Hill, New York, 1990.
R. P. Dilworth: A decomposition theorem for partially ordered sets,Ann. of Math. 51 (1950), 161–166.
G. Ding, P. Seymour, and P. Winkler: Bounding the vertex cover number of a hypergraph,Combinatorica, to appear.
P. Erdős: On sets of distances ofn points,Amer. Math. Monthly 53 (1964), 248–250.
P. Erdős and G. Szekeres: A combinatorial problem in geometry,Compositio Math. 2 (1935), 464–470.
W. Goddard, M. Katchalski, and D. J. Kleitman: Forcing disjoint segments in the plane, Manuscript.
R. L. Graham, B. L. Rothschild, and J. H. Spencer:Rarnsey Theory, 2nd edn., Wiley, New York, 1990.
A. Gyárfás and J. Lehel: Covering and coloring problems for relatives of intervals,Discrete Math. 55 (1985), 167–180.
H. Hopf and E. Pannwitz: Aufgabe No. 167,Jahresber. Deutsch. Math.-Verein. 43 (1934), 114.
Y. S. Kyoutz:Extremal Problems in Combinatorial Geometry, Aarhus University Lecture Notes Series, No. 53, Aarhus University, Denmark, 1979.
D. Larman, J. Matoušek, J. Pach, and J. Yörőcsik: A Ramsey-type result for planar convex sets, to appear.
P. O’Donnel and M. Perles: Every geometric graph withn vertices and 3.6n+3.4 edges contains three pairwise disjoint edges, Manuscript, Rutgers University, New Brunswick, 1991.
F. P. Ramsey: On a problem of formal logic,Proc. London Math. Soc. 30 (1930), 264–286.
Author information
Authors and Affiliations
Additional information
The research by János Pach was supported by Hungarian National Foundation for Scientific Research Grant OTKA-4269 and NSF Grant CCR-91-22103.
Rights and permissions
About this article
Cite this article
Pach, J., Törőcsik, J. Some geometric applications of Dilworth’s theorem. Discrete Comput Geom 12, 1–7 (1994). https://doi.org/10.1007/BF02574361
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02574361