Conjectured crossing numbers for K_1,1,3,n and K_2,4,n
Statement
Let denote the complete multipartite graph whose parts have sizes , let denote the complete multipartite graph with parts of sizes , , and , and let be the crossing number of a graph . Let denote the Zarankiewicz expression
The crossing-number conjectures. For the relevant positive integer ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.