Staden–Treglown conjecture for squares of Hamilton cycles
Statement
Let be an -vertex graph, with minimum degree and independence number . 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 , there exist and such that the following holds. For every -vertex graph with , if
and
then 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.