Ahadi et al.'s three-subgraph conjecture
Statement
Let be a graph. A subgraph is called locally irregular if adjacent vertices have distinct degrees, and regular if all its vertices have the same degree.
Ahadi et al.'s conjecture. Every graph can be partitioned into three subgraphs, each of which is locally irregular or regular.
The source says this conjecture weakens the locally irregular three-partition conjecture and strengthens the regular-irregular two-partition conjecture. It gives no resolution.
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.