The three-subgraph locally irregular or weakly semiregular conjecture
Statement
Let be a graph. A graph is weakly semiregular if there are two numbers such that every vertex has degree or . A subgraph is locally irregular if adjacent vertices have distinct degrees.
Three-subgraph conjecture. Every graph can be partitioned into three subgraphs, such that each subgraph is locally irregular or weakly semiregular.
The source introduces this as a variant motivated by the regular-irregular edge-partition conjecture: unlike that conjecture, the condition is imposed on each whole subgraph rather than separately on each component. No resolution is given.
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.