The almost-spanning cycle conjecture for sparse random hypercube subgraphs
Statement
Let be the -dimensional hypercube, and let be the random subgraph obtained by retaining each edge independently with probability . The almost-spanning cycle conjecture. If , then asymptotically almost surely contains a cycle of length . The preceding theorem proves the corresponding assertion for fixed and any fixed positive loss in the proportion of vertices; the conjecture asks for an almost-spanning cycle throughout the wider sparse range.
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.