ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Qn\mathcal{Q}^n be the nn-dimensional hypercube, and let Qpn\mathcal{Q}^n_p be the random subgraph obtained by retaining each edge independently with probability p=p(n)p=p(n). The almost-spanning cycle conjecture. If pn→∞pn\to\infty, then asymptotically almost surely Qpn\mathcal{Q}^n_p contains a cycle of length (1−o(1))2n(1-o(1))2^n. The preceding theorem proves the corresponding assertion for fixed p>0p>0 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 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.