ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Vc(g)V_c(g) be the maximum number of vertices of a graph of genus gg embedded in a surface, and let b(g)b(g) be the stated upper bound for this quantity. For an integer SS satisfying S≡1S\equiv 1 or 3(mod6)3\pmod 6, set

g=(S−1)(S−3)6.g=\frac{(S-1)(S-3)}{6}.

Super-maximization conjecture. One has

Vc(g)=b(g)V_c(g)=b(g)

whenever g=(S−1)(S−3)6≥4g=\frac{(S-1)(S-3)}{6}\geq 4 and S≡1S\equiv 1 or 3(mod6)3\pmod 6. This extends the theorem's verified infinite family of cases with S≡7(mod12)S\equiv 7\pmod {12}, together with S=9S=9, 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 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.