ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let W:Ω2→[0,1]W:\Omega^2\to[0,1] be a graphon, let k≥2k\ge 2 be fixed, and let G(n,W)\mathbb{G}(n,W) be the associated inhomogeneous random graph. A Kk+1K_{k+1}-fractional cover of WW is a measurable function f:Ω→[0,1]f:\Omega\to[0,1] such that for almost every (k+1)(k+1)-tuple (x1,…,xk+1)(x_1,\ldots,x_{k+1}), either ∑i=1k+1f(xi)≥1\sum_{i=1}^{k+1}f(x_i)\ge1 or at least one pair among the tuple has graphon value zero. Hamilton-power conjecture. The graph G(n,W)\mathbb{G}(n,W) contains asymptotically almost surely the kk-th power of a Hamilton cycle if and only if: WW is a connected graphon; lim⁡α↘0μ(Dα(W))/α=0\lim_{\alpha\searrow0}\mu(\mathsf{D}_\alpha(W))/\alpha=0; and the only Kk+1K_{k+1}-fractional cover of WW with L1L^1-norm at most 1/(k+1)1/(k+1) is the constant function 1/(k+1)1/(k+1). The conjecture extends the Hamilton-cycle characterization to higher powers, replacing the perfect-matching obstruction by the corresponding Kk+1K_{k+1}-tiling obstruction.

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.