On resilience of connectivity in the evolution of random graphs

zbMath1412.05118arXiv1805.08744MaRDI QIDQ2415088

Miloš Trujić, Luc Haller

Publication date: 20 May 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.08744

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Size and connectivity of the \(k\)-core of a random graph
• Hamiltonicity in random graphs is born resilient
• Covering cycles and \(k\)-term degree sums
• 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
• On the strength of connectedness of a random graph
• Local resilience of graphs
• Tree-Matchings in Graph Processes
• Local resilience of an almost spanning k‐cycle in random graphs
• Resilience of perfect matchings and Hamiltonicity in random graph processes
• Large-scale structures in random graphs
• Robustness of graph properties
• Random Graphs
• Some Theorems on Abstract Graphs
• Proof of the Alon-Yuster conjecture

This page was built for publication: On resilience of connectivity in the evolution of random graphs