The sublinear upper-bound conjecture for the crossing profile of complete graphs
Statement
For a rectilinear drawing of the complete graph , let denote the number of edges crossed exactly times, and let
denote the maximum of over all rectilinear drawings of . Sublinear crossing-profile conjecture. For every and ,
More precisely, for every there exists a constant such that if and are larger than , then . The paper establishes the bounds 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.