Quadratic saturation score conjecture for Hamiltonicity
Statement
Let be the graph property of admitting a Hamilton cycle, and let denote the score of the corresponding saturation game on graphs with vertices. Hamiltonicity saturation-score conjecture.
The conjecture concerns the asymptotic score of the Hamiltonicity saturation game. The paper notes that the extremal number is , while the saturation number is for sufficiently large ; determining the game score remains open.
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.