Shifted Chvátal-resilience conjecture for Hamilton cycles in random graphs
Let be a random graph, and let -Chvátal-resilience mean resilience with respect to subgraphs satisfying the shifted Chvátal degree condition: there is an ordering with such that, for every , either
or
Shifted Chvátal-resilience conjecture. For every , there exists such that, for , a.a.s. the random graph is -Chvátal-resilient with respect to Hamiltonicity.
This conjecture proposes the Hamilton-cycle analogue of the preceding theorem for perfect matchings, extending Chvátal-type resilience to Hamiltonicity in sparse random graphs. Its resolution status is not specified in the supplied text.
References
- Padraig Condon, Alberto Espuny Díaz, Jaehoon Kim, Daniela Kühn and Deryk Osthus, “Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs”, arXiv:1810.12433 (2019).
Progress summary
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.