The convex-polygon realization conjecture for maximum rectilinear crossing numbers
Statement
Let be any graph. A rectilinear drawing represents the vertices of by points in the plane and its edges by straight-line segments. A convex-polygon drawing is one in which all vertices are vertex points of a convex polygon.
Convex-polygon realization conjecture. The maximum rectilinear crossing number of can be realized in a convex-polygon drawing.
If true, this would reduce the search for maximum rectilinear crossing numbers to drawings with all vertices in convex position. The paper presents this as a general conjecture useful for determining the maximum rectilinear crossing number.
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.