Asymptotic upper-bound conjecture for the maximum order of graphs embedded in surfaces
Statement
Let be a surface of genus , let denote the class of graphs embeddable in , and let be the maximum order of a graph in with maximum degree at most and no cycle of length at most . There exist a constant and a function such that, for ,
The authors believe that the asymptotic value of is closer to the lower bound than to the stated upper bound, so this asymptotic estimate is not expected to be 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.