ProbXiv
Explorersign in
Problem archiveProblem record

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 EMST⁡(R)\operatorname{EMST}(R) and an edge of EMST⁡(B)\operatorname{EMST}(B). 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.