Došlić–Vukićević explicit conjecture for bipartizing fullerenes
Statement
Let be a fullerene graph with vertices, and let be the minimum number of edges whose removal makes bipartite. Došlić–Vukićević explicit conjecture.
This is presented as a stronger form of the asymptotic conjecture that ; no resolution is given in the supplied text.
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.