ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph. Write reg(G)reg(G) for the minimum number of edge-partition classes whose induced subgraphs are regular, and let Δ(G)\Delta(G) be the maximum degree of GG.

The degree-bound conjecture. For every connected graph GG,

reg(G)≤Δ(G).reg(G)\leq \Delta(G).

The paper states that this conjecture is false: counterexamples exist, and deciding whether reg(G)=Δ(G)+1reg(G)=\Delta(G)+1 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 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.