ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an nn-vertex graph, with minimum degree δ(G)\delta(G) and independence number α(G)\alpha(G). A square of a Hamilton cycle is the graph obtained by joining vertices whose distance on the Hamilton cycle is at most two.

Staden–Treglown conjecture. For every μ>0\mu>0, there exist α>0\alpha>0 and 0∈N _0\in \mathbb{N} such that the following holds. For every nn-vertex graph GG with ≥n0 \geq n_0, if

δ(G)≥(12+μ)n\delta(G)\geq \left(\frac{1}{2}+\mu\right)n

and

α(G)≤αn,\alpha(G)\leq \alpha n,

then GG contains a square of a Hamilton cycle.

This conjecture concerns Hamiltonian spanning structures in graphs with sublinear independence number. The source attributes it to Staden and Treglown; its resolution status is not specified here.

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.