On the resilience of long cycles in random graphs
From MaRDI portal
Publication:1010740
zbMath1181.05053MaRDI QIDQ1010740
Angelika Steger, Domingos jun. Dellamonica, Martin Marciniszyn, Yoshiharu Kohayakawa
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/117224
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)
Related Items (15)
Dirac's theorem for random graphs ⋮ Long cycles in subgraphs of (pseudo)random directed graphs ⋮ Pancyclic subgraphs of random graphs ⋮ Local resilience of spanning subgraphs in sparse random graphs ⋮ Graph Tilings in Incompatibility Systems ⋮ On some Multicolor Ramsey Properties of Random Graphs ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ Robust Hamiltonicity of Dirac graphs ⋮ Unnamed Item ⋮ Local resilience of almost spanning trees in random graphs ⋮ Bandwidth theorem for random graphs ⋮ Almost spanning subgraphs of random graphs after adversarial edge removal ⋮ Robustness of randomized rumour spreading ⋮ Hamiltonicity in random graphs is born resilient
This page was built for publication: On the resilience of long cycles in random graphs
