ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a 2-connected noncomplete graph, and let diam(G)diam(G) denote its diameter. Let pc(G)pc(G) denote the minimum number of colors in an edge-coloring such that every pair of distinct vertices is joined by a proper path. Li and Magnant's conjecture. If

diam(G)=3,diam(G)=3,

then

pc(G)=2.pc(G)=2.

The claim proposes a sharp two-color bound for proper connection in this class of 2-connected graphs; its status is not established by 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 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.