Pancyclic subgraphs of random graphs

DOI10.1002/jgt.20638zbMath1248.05190arXiv1005.5716OpenAlexW1579899622MaRDI QIDQ2911059

Choongbum Lee, Wojciech Samotij

Publication date: 12 September 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

Hamiltonicityrandom graphpancyclicity

Mathematics Subject Classification ID

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

Cites Work

• Combinatorial theorems in sparse random sets
• Bandwidth theorem for random graphs
• On two Hamilton cycle problems in random graphs
• On the resilience of long cycles in random graphs
• Pancyclic Hamilton cycles in random graphs
• Cycles in random graphs
• Cycles of even length in graphs
• Turán's extremal problem in random graphs: Forbidding odd cycles
• Pancyclic graphs. I
• Almost spanning subgraphs of random graphs after adversarial edge removal
• Local resilience of almost spanning trees in random graphs
• Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs
• Resilient Pancyclicity of Random and Pseudorandom Graphs
• 1-Pancyclic Hamilton Cycles in Random Graphs
• On the asymmetry of random regular graphs and random graphs

This page was built for publication: Pancyclic subgraphs of random graphs