ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Ka1,a2,a3,nK_{a_1,a_2,a_3,n} denote the complete multipartite graph whose parts have sizes a1,a2,a3,na_1,a_2,a_3,n, let K2,4,nK_{2,4,n} denote the complete multipartite graph with parts of sizes 22, 44, and nn, and let cr(G)cr(G) be the crossing number of a graph GG. Let Z(m,n)Z(m,n) denote the Zarankiewicz expression

Z(m,n)=⌊m2⌋⌊m−12⌋⌊n2⌋⌊n−12⌋.Z(m,n)=\left\lfloor\frac{m}{2}\right\rfloor\left\lfloor\frac{m-1}{2}\right\rfloor\left\lfloor\frac{n}{2}\right\rfloor\left\lfloor\frac{n-1}{2}\right\rfloor.

The crossing-number conjectures. For the relevant positive integer nn,

cr(K1,1,3,n)=Z(5,n)+⌊3n2⌋;cr(K_{1,1,3,n})=Z(5,n)+\left\lfloor\frac{3n}{2}\right\rfloor; cr(K2,4,n)=Z(6,n)+2n.cr(K_{2,4,n})=Z(6,n)+2n.

These are proposed in the paper's conclusion as further crossing-number formulas; the source provides no resolution.

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.