A graph G is said to be uniquely H-saturated if it contains no H, but adding any edge to G creates exactly one copy of H
Statement
: A graph G is said to be uniquely H-saturated if it contains no H, but adding any edge to G creates exactly one copy of H (up to isomorphism). Clearly, if G is uniquely K_(r)-saturated, then joining a single vertex to G creates a uniquely K_(r)(+1)-saturated graph. Call a uniquely K(r)-saturated graph sporadic if it has no dominating vertex. Is it true that, for each r, there are finitely many sporadic uniquely K_(r)-saturated 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.