The random sub-sampling local-resilience conjecture for powers of cycles
Let denote the th power of the cycle on vertices, and let . The random sub-sampling local-resilience conjecture. There exists large enough such that, for every , independently sampling each edge of with probability much greater than produces, with high probability, a graph all of whose -subgraphs are Hamiltonian. This would combine the local-resilience phenomenon for powers of cycles with random edge sampling; the source presents it as an open problem and gives no resolution.
References
- Richard Lang, Alp Müyesser, Mathias Schacht and Carl Schildkraut, “Dirac subgraphs of powers of cycles are Hamiltonian”, arXiv:2606.07471 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.