Long paths and cycles in random subgraphs of H-free graphs

Research output: Contribution to journalArticlepeer-review


Let H be a given finite (possibly empty) family of connected graphs, each containing a cycle, and let G be an arbitrary finite H-free graph with minimum degree at least k. For p ∈ [0, 1], we form a p-random subgraph Gp of G by independently keeping each edge of G with probability p. Extending a classical result of Ajtai, Komlós, and Szemerédi, we prove that for every positive ε, there exists a positive δ (depending only on ε) such that the following holds: If p ≥ 1+ε/k, then with probability tending to 1 as k → ∞, the random graph Gp contains a cycle of length at least nH(δk), where nH(k) > k is the minimum number of vertices in an H-free graph of average degree at least k. Thus in particular Gp as above typically contains a cycle of length at least linear in k.

Original languageEnglish
JournalElectronic Journal of Combinatorics
Issue number1
StatePublished - 13 Feb 2014

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Long paths and cycles in random subgraphs of H-free graphs'. Together they form a unique fingerprint.

Cite this