Abstract.
For any 2-coloring of the \({n \choose 2}\) segments determined by n points in general position in the plane, at least one of the color classes contains a non-self-intersecting spanning tree. Under the same assumptions, we also prove that there exist \(\lfloor (n+1)/3 \rfloor\) pairwise disjoint segments of the same color, and this bound is tight. The above theorems were conjectured by Bialostocki and Dierker. Furthermore, improving an earlier result of Larman et al., we construct a family of m segments in the plane, which has no more than \(m^{\log 4/\log 27}\) members that are either pairwise disjoint or pairwise crossing. Finally, we discuss some related problems and generalizations.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received October 17, 1995, and in revised form February 10, 1996.
Rights and permissions
About this article
Cite this article
Károlyi, G., Pach, J. & Tóth, G. Ramsey-Type Results for Geometric Graphs, I . Discrete Comput Geom 18, 247–255 (1997). https://doi.org/10.1007/PL00009317
Issue Date:
DOI: https://doi.org/10.1007/PL00009317