ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a rectilinear drawing of the complete graph KnK_n, let ek(Kn)e_k(K_n) denote the number of edges crossed exactly kk times, and let

max⁡‾ ek(Kn)\overline\max\ e_k(K_n)

denote the maximum of ek(Kn)e_k(K_n) over all rectilinear drawings of KnK_n. Sublinear crossing-profile conjecture. For every n≥1n\geq 1 and k≥1k\geq 1,

max⁡‾ ek(Kn)=o(nk).\overline\max\ e_k(K_n)=o(n\sqrt{k}).

More precisely, for every ϵ>0\epsilon>0 there exists a constant NN such that if nn and kk are larger than NN, then max⁡‾ ek(Kn)/(nk)<ϵ\overline\max\ e_k(K_n)/(n\sqrt{k})<\epsilon. The paper establishes the bounds Ω(n)≤max⁡‾ ek(Kn)≤O(nk)\Omega(n)\leq\overline\max\ e_k(K_n)\leq O(n\sqrt{k}) in the stated range, and this conjecture proposes that the upper bound is asymptotically non-sharp.

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.