ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A cubic graph is a graph in which every vertex has degree three. Mohar's conjecture. Approximating the genus of cubic graphs is APX-hard. This conjecture asserts computational hardness in the spherical-density regime, where graphs have average degree at most six; resolving the broader question of efficient constant-factor approximation in this regime is identified as a major open problem.

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.