ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph of order nn. The path extremal conjecture.

vcfc(G)≤vcfc(Pn).vcfc(G)\leq vcfc(P_n).

Here vcfc(G)vcfc(G) denotes the conflict-free vertex-connection number of GG, and PnP_n is the path on nn vertices. The conjecture proposes that among connected graphs of a fixed order, the path has maximum conflict-free vertex-connection number. The surrounding results establish upper bounds for trees and connected graphs in terms of radius and order, but do not settle this extremal assertion.

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.