Hamilton powers conjecture for inhomogeneous random graphs
Statement
Let be a graphon, let be fixed, and let be the associated inhomogeneous random graph. A -fractional cover of is a measurable function such that for almost every -tuple , either or at least one pair among the tuple has graphon value zero. Hamilton-power conjecture. The graph contains asymptotically almost surely the -th power of a Hamilton cycle if and only if: is a connected graphon; ; and the only -fractional cover of with -norm at most is the constant function . The conjecture extends the Hamilton-cycle characterization to higher powers, replacing the perfect-matching obstruction by the corresponding -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.