Mohar's APX-hardness conjecture for the genus of cubic graphs
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.