Connect the Dots: Prove 2 Line Segments from Red/Blue Points

[Jimmy Snyder]

There are 4 points in the plane. Two are red, two are blue. No three points lie on the same line. Prove that you can draw two line segments, each one connecting a red point to a blue point, and such that the two line segments do not intersect.

 

[AKG]

Pick a blue dot, and first join both red dots to that blue dot. Pick one of the red dots, and consider the region of the plane that the other red dot can't "see" due to the presence of the segment joining the first red dot to the blue dot (i.e. this segment acts like a wall). If the second blue dot is in this hidden area, then remove the wall, and join the first red dot to the second blue dot. If the second blue dot is visible to the second red dot, then leave the wall in place, remove the segment joining the second red dot to the first blue dot, and instead draw a segment from the second red dot to the second blue dot.

 

[Jimmy Snyder]

Nice solution, AKG, very elegant. But will it scale? Now there are 6 points in the plane. Three are red, three are blue. No three points lie on the same line. Prove that you can draw three line segments, each one connecting a red point to a blue point, and such that no two line segments intersect.