Long alternating paths in bicolored point sets

Abstract

Given n red and n blue points in convex position in the plane, we show that there exists a noncrossing alternating path of length n + c n / log n . We disprove a conjecture of Erdős by constructing an example without any such path of length greater than 4 / 3 n + c ′ n .