Pancyclic subgraphs of random graphs
Pancyclic subgraphs of random graphs
Abstract An n ‐vertex graph is called pancyclic if it contains a cycle of length t for all 3≤ t ≤ n . In this article, we study pancyclicity of random graphs in the context of resilience, and prove that if p > n −1/2 , then the random graph …