Resilient Pancyclicity of Random and Pseudorandom Graphs

DOI10.1137/090761148zbMath1215.05165arXiv0906.1397OpenAlexW2045530818WikidataQ105584152 ScholiaQ105584152MaRDI QIDQ3084209

Michael Krivelevich, Choongbum Lee, Benjamin Sudakov

Publication date: 15 March 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random graphspancyclicityresilience

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)

Related Items (22)

Corrádi and Hajnal's Theorem for Sparse Random Graphs ⋮ Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs ⋮ Dirac's theorem for random graphs ⋮ Long cycles in subgraphs of (pseudo)random directed graphs ⋮ On the Hamiltonicity of random bipartite graphs ⋮ Pancyclic subgraphs of random graphs ⋮ Generating random graphs in biased Maker-Breaker games ⋮ Spanning Structures in Walker–Breaker Games ⋮ Robust Hamiltonicity of random directed graphs ⋮ Triangle resilience of the square of a Hamilton cycle in random graphs ⋮ Embedding cycles in finite planes ⋮ Graph Tilings in Incompatibility Systems ⋮ A Dirac-type theorem for Berge cycles in random hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Extremal results for odd cycles in sparse pseudorandom graphs ⋮ A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs ⋮ Robust Hamiltonicity of Dirac graphs ⋮ Local resilience of almost spanning trees in random graphs ⋮ Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs ⋮ Bandwidth theorem for random graphs ⋮ Hamiltonicity in random directed graphs is born resilient ⋮ Dirac’s theorem for random regular graphs

This page was built for publication: Resilient Pancyclicity of Random and Pseudorandom Graphs