Reed's path partition conjecture for 2-connected cubic graphs
Statement
Let be a -connected -regular graph of order , and let denote its path partition number.
Reed's conjecture. The path partition number satisfies
The source states that Yu recently settled this conjecture, so it is recorded as solved.
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.