ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Σ\Sigma be a surface of genus gg, let GΣ\mathcal{G}_\Sigma denote the class of graphs embeddable in Σ\Sigma, and let N(Δ,k,GΣ)N(\Delta,k,\mathcal{G}_\Sigma) be the maximum order of a graph in GΣ\mathcal{G}_\Sigma with maximum degree at most Δ\Delta and no cycle of length at most kk. There exist a constant cc and a function Δ0:=Δ0(g,k)\Delta_0:=\Delta_0(g,k) such that, for Δ≥Δ0\Delta\ge \Delta_0,

N(Δ,k,GΣ)≤{c(Δ−1)⌊k/2⌋if k is evenc(g+1)(Δ−1)⌊k/2⌋if k is odd.N(\Delta,k,\mathcal{G}_\Sigma)\le\begin{cases} c(\Delta-1)^{\lfloor {k}/{2}\rfloor}& \text{if $k$ is even}\\ c(\sqrt{g}+1)(\Delta-1)^{\lfloor {k}/{2}\rfloor}& \text{if $k$ is odd.} \end{cases}

The authors believe that the asymptotic value of N(Δ,k,GΣ)N(\Delta,k,\mathcal{G}_\Sigma) 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 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.