Local resilience of spanning subgraphs in sparse random graphs

DOI10.1016/j.endm.2015.06.071zbMath1346.05261OpenAlexW2177161926MaRDI QIDQ322312

Mohammad Hasan, M. Dambrine

Publication date: 14 October 2016

Full work available at URL: http://eprints.lse.ac.uk/64637/1/__lse.ac.uk_storage_LIBRARY_Secondary_libfile_shared_repository_Content_Allen%2C%20Peter_Local%20resilience_Allen_Local%20resilience_2015.pdf

zbMATH Keywords

random graphsextremal graph theoryresiliencesparse regularity

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)

Related Items (1)

On Komlós’ tiling theorem in random graphs

Cites Work

• Bandwidth theorem for random graphs
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
• On the resilience of long cycles in random graphs
• Almost spanning subgraphs of random graphs after adversarial edge removal
• Corrádi and Hajnal's Theorem for Sparse Random Graphs
• Local resilience of almost spanning trees in random graphs
• Dirac's theorem for random graphs
• Embedding large subgraphs into dense graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Local resilience of spanning subgraphs in sparse random graphs