Local resilience of an almost spanning k‐cycle in random graphs
From MaRDI portal
Publication:4625026
DOI10.1002/RSA.20817zbMath1502.05228arXiv1709.03901OpenAlexW2964065454MaRDI QIDQ4625026
Nemanja Škorić, Angelika Steger, Miloš Trujić
Publication date: 20 February 2019
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.03901
Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)
Related Items (8)
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs ⋮ Dirac-type theorems in random hypergraphs ⋮ Triangle resilience of the square of a Hamilton cycle in random graphs ⋮ On resilience of connectivity in the evolution of random graphs ⋮ The size‐Ramsey number of cubic graphs ⋮ Covering cycles in sparse graphs ⋮ A Dirac-type theorem for Berge cycles in random hypergraphs ⋮ Dirac’s theorem for random regular graphs
This page was built for publication: Local resilience of an almost spanning k‐cycle in random graphs
