Minimum edge condition for proper connection number two
Statement
Let be a connected graph of order . Write for the minimum degree of , let , and let be defined by if and if .
The minimum edge condition conjecture. If and
then .
This conjecture proposes a sharp-looking sufficient edge condition for a connected graph to have proper connection number at most two. The supplied source does not state a resolution, so its status remains open.
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.