ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let K2ddK_{2d}^d be the complete dd-uniform hypergraph on 2d2d vertices, and let cr‾d(K2dd)\overline {cr}_d(K_{2d}^d) denote its rectilinear crossing number in dd dimensions. Rectilinear crossing-number conjecture.

cr‾d(K2dd)=Ω(2dd).\overline {cr}_d(K_{2d}^d)=\Omega (2^d \sqrt{d}).

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 cr‾d(K2dd)=Ω(2d)\overline {cr}_d(K_{2d}^d)=\Omega(2^d), 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 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.