Saturation spectrum conjecture for three unions of cycles
Statement
Let denote the set of edge counts of -vertex -saturated graphs. For , the conjectured spectrum is
Saturation spectrum conjecture.
The displayed intervals and additional values arise from constructions and previously established inclusions, but the equality is presented as a conjecture and is not resolved in the source.
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.