ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected noncomplete graph with nn vertices, where n≥5n\geq 5, and let δ(G)\delta(G) denote its minimum degree. Li–Magnant's proper connection conjecture. Then

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

This conjecture proposes that the sharp minimum-degree threshold δ(G)≥n/4\delta(G)\geq n/4 guarantees a proper connection number of two, extending the known result that requires n≥68n\geq 68. Its resolution is the subject of the source paper.

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.