ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a planar graph of order nn, and let ψ3(G)\psi_3(G) denote its 3-path vertex cover number.

Planar 3-path vertex cover conjecture.

ψ3(G)≤23n.\psi_3(G) \le \frac{2}{3}n.

This conjecture was first mentioned by Brešar et al. in 2011. Equality is attained by, for example, vertex-disjoint unions of octahedron graphs arranged in a planar way; the conjecture remains open in the source.

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.