For the random graph process, determine what happens when the number r of edge-disjoint Hamilton cycles is allowed to grow with n; in particular, determine the threshold for…
Statement
For the random graph process, determine what happens when the number r of edge-disjoint Hamilton cycles is allowed to grow with n; in particular, determine the threshold for finding r such cycles in terms of the minimum degree and edge probability.
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.