Kynčl–Pach–Tóth alternating path conjecture
Statement
For every set of red and blue points on a circle, let be the largest number such that there is a non-crossing alternating path with vertices. Kynčl–Pach–Tóth alternating path conjecture.
The conjecture claims that the known upper bound for the longest non-crossing alternating path is asymptotically tight. The paper explicitly states that its main theorem disproves this conjecture, so it is refuted.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.