Ramsey-type results for geometric graphs. I (Q1380815): Difference between revisions

This paper deals with some Ramsey-type results for geometric graphs. The specific results are: (1) 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 pairwise spanning tree. (2) Under the same assumptions, the authors also proved that there exist \(\lfloor (n+1)/3 \rfloor\) pairwise disjoint segments of the same color, and this bound is tight. (3) Improving an earlier result of Larman et al., they constructed 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.