ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let dd be a positive integer and let GG be a graph. The graph GG is dd-distinguishing critical if its distinguishing number is dd and every proper induced subgraph of GG has distinguishing number less than dd.

Regularity and component conjecture. (i) If GG is a dd-distinguishing critical graph, then GG is a kk-regular graph for some k≤dk\leq d. (ii) If GG is a disconnected dd-distinguishing critical graph, then each component of GG is a complete graph.

The paper establishes this structure for several small values of dd and proves that the only distinguishing critical tree is K2K_2; the conjecture proposes the general regularity and complete-component conclusions.

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.