Regularity conjecture for uniquely K_r-saturated graphs
Statement
Let be a positive integer. A graph is uniquely -saturated if it is -free and adding any missing edge creates exactly one copy of ; 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 , a uniquely -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.