Answers are grounded in this paper and cite their sources.
Let be the random subgraph of the ‐dimensional binary hypercube obtained after edge‐percolation with probability . It was shown recently by the authors that, for every , there is some such that, if , then typically contains a cycle of length at least . We strengthen this result to show that, under the same assumptions, typically contains cycles of all even lengths between four and .
No takes yet. Share an insight, caveat, or question.
A 2026 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: