The rectilinear crossing-number conjecture for complete uniform hypergraphs
Statement
Let be the complete -uniform hypergraph on vertices, and let denote its rectilinear crossing number in dimensions. Rectilinear crossing-number conjecture.
The paper proves this lower bound for several placements of the vertices, but the conjecture concerns the rectilinear crossing number in general. The preceding discussion establishes only the weaker bound , so the conjectured improvement remains unresolved in the supplied text.
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.