On the resilience of long cycles in random graphs

MaRDI QIDQ1010740zbMATH OpenFDO

Authors Domingos Dellamonica, Yoshiharu Kohayakawa, Martin Marciniszyn, Angelika Steger

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, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r32.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Resilient pancyclicity of random and pseudorandom graphs
• Long cycles in subgraphs of (pseudo)random directed graphs
• Local resilience of graphs
• scientific article; zbMATH DE number 3916307
• Turán‐type problems for long cycles in random and pseudo‐random graphs

Cited in

(20)

• Long cycles in random subgraphs of graphs with large minimum degree
• Local resilience of almost spanning trees in random graphs
• Pancyclic subgraphs of random graphs
• An analogue of the Erdős-Gallai theorem for random graphs
• Resilient pancyclicity of random and pseudorandom graphs
• Hamiltonicity in random graphs is born resilient
• Local resilience of graphs
• On some multicolor Ramsey properties of random graphs
• Bandwidth theorem for random graphs
• Turán‐type problems for long cycles in random and pseudo‐random graphs
• Local resilience of spanning subgraphs in sparse random graphs
• scientific article; zbMATH DE number 1335045 (Why is no real title available?)
• Triangle resilience of the square of a Hamilton cycle in random graphs
• Long cycles in subgraphs of (pseudo)random directed graphs
• Local resilience of an almost spanning k‐cycle in random graphs
• Dirac's theorem for random graphs
• Robustness of randomized rumour spreading
• scientific article; zbMATH DE number 7525473 (Why is no real title available?)
• Robust Hamiltonicity of Dirac graphs
• Graph Tilings in Incompatibility Systems

This page was built for publication: On the resilience of long cycles in random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010740)