ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SgS_g be a compact orientable surface of genus g>0g>0, and let GG be a graph with nn vertices and mm edges. Cairns–Nikolayevsky's conjecture. If GG can be thrackled on SgS_g, then

m≤n+2g.m\le n+2g.

Odd cycles and recursive constructions provide examples with n+2gn+2g edges, motivating this proposed maximum. The paper states that this conjecture is disproved by constructions with substantially more edges, so the claim is not open.

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.