Conjecture on super-maximized genera of graphs in surfaces
Statement
Let be the maximum number of vertices of a graph of genus embedded in a surface, and let be the stated upper bound for this quantity. For an integer satisfying or , set
Super-maximization conjecture. One has
whenever and or . This extends the theorem's verified infinite family of cases with , together with , and asserts that all admissible genera in this parametrized family are super-maximized.
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.