Sciweavers

GD
2004
Springer

Long Alternating Paths in Bicolored Point Sets

14 years 4 months ago
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 + c n log n . We disprove a conjecture of Erd˝os by constructing an example without any such path of length greater than 4 3 n + c √ n.
Jan Kyncl, János Pach, Géza Tó
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where GD
Authors Jan Kyncl, János Pach, Géza Tóth
Comments (0)