ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. A graph is weakly semiregular if there are two numbers a,ba,b such that every vertex has degree aa or bb. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.