Kowalik–Lużar–Skrekovski conjecture for planar graphs of girth at least five
Statement
A feedback vertex set of a graph is a set such that is a forest. Let denote the minimum size of a feedback vertex set of . The girth of a graph is the length of its shortest cycle, with girth infinity for an acyclic graph. Kowalik–Lużar–Skrekovski conjecture. If is a planar graph of girth at least five on vertices, then
The bound is tight because the dodecahedron attains it. The supplied text does not state a resolution of this conjecture; the source paper presents it as an active problem and develops improved bounds toward it.
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.