Resilience of perfect matchings and Hamiltonicity in random graph processes
From MaRDI portal
Publication:5229343
DOI10.1002/rsa.20827zbMath1417.05189arXiv1710.00799OpenAlexW2963201929WikidataQ128763722 ScholiaQ128763722MaRDI QIDQ5229343
Rajko Nenadov, Miloš Trujić, Angelika Steger
Publication date: 14 August 2019
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.00799
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (11)
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 global resilience of Hamiltonicity in \(G(n, p)\) ⋮ Color‐biased Hamilton cycles in random graphs ⋮ Covering cycles in sparse graphs ⋮ A Dirac-type theorem for Berge cycles in random hypergraphs ⋮ Hamiltonicity in random directed graphs is born resilient ⋮ Dirac’s theorem for random regular graphs ⋮ Hamiltonicity in random graphs is born resilient
This page was built for publication: Resilience of perfect matchings and Hamiltonicity in random graph processes
