What is the saturation number sat(n,C_k), the minimum number of edges in a C_k-free graph on n vertices such that adding any missing edge creates a copy of C_k?
Statement
What is the saturation number sat(n,C_k), the minimum number of edges in a C_k-free graph on n vertices such that adding any missing edge creates a copy of C_k?
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.