Long alternating paths in bicolored point sets

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+cn/logn. We disprove a conjecture of Erdős by constructing an example without any such path of length greater than 4/3n+c′n.