ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A feedback vertex set of a graph GG is a set S⊆V(G)S\subseteq V(G) such that G−SG-S is a forest. Let ϕ(G)\phi(G) denote the minimum size of a feedback vertex set of GG. 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 GG is a planar graph of girth at least five on nn vertices, then

ϕ(G)≤3n10.\phi(G)\leq\frac{3n}{10}.

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 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.