ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let rr be a positive integer. A graph is uniquely KrK_r-saturated if it is KrK_r-free and adding any missing edge creates exactly one copy of KrK_r; a dominating vertex is a vertex adjacent to every other vertex. A graph is regular if all its vertices have the same degree.

Regularity conjecture. For each rr, a uniquely KrK_r-saturated graph with no dominating vertex is regular.

All examples known in the source are regular, which motivates this conjecture. Its resolution is not supplied and remains open in the paper's context.

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.