ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H{\mathcal H} be the graph property of admitting a Hamilton cycle, and let s(n,H)s(n, {\mathcal H}) denote the score of the corresponding saturation game on graphs with nn vertices. Hamiltonicity saturation-score conjecture.

s(n,H)=Θ(n2).s(n, {\mathcal H}) = \Theta(n^2).

The conjecture concerns the asymptotic score of the Hamiltonicity saturation game. The paper notes that the extremal number is ex(n,H)=(n−12)+1ex(n, {\mathcal H}) = \binom{n-1}{2}+1, while the saturation number is sat(n,H)=⌈3n/2⌉sat(n, {\mathcal H}) = \lceil 3n/2\rceil for sufficiently large nn; 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.