NP-hardness conjecture for the maximum chromatic crossing number
Statement
For a finite point set in the plane and a red-blue partition, the chromatic crossing number is the number of crossings between an edge of and an edge of . The maximum chromatic crossing number is the largest such number over all colorings. Maximum chromatic crossing-number conjecture. Finding the maximum chromatic crossing number of a point set in the plane is NP-hard.
The source poses this as a complexity question alongside questions about the possible size of the parameter and its relation to the EMST-ratio; no resolution is given.
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.