Li–Magnant proper connection conjecture
Statement
Let be a connected noncomplete graph with vertices, where , and let denote its minimum degree. Li–Magnant's proper connection conjecture. Then
This conjecture proposes that the sharp minimum-degree threshold guarantees a proper connection number of two, extending the known result that requires . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.