The degree bound for the regular number of connected graphs
Statement
Let be a connected graph. Write for the minimum number of edge-partition classes whose induced subgraphs are regular, and let be the maximum degree of .
The degree-bound conjecture. For every connected graph ,
The paper states that this conjecture is false: counterexamples exist, and deciding whether is NP-complete for connected graphs.
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.