Dense subgraphs in the \(H\)-free process

DOI10.1016/j.disc.2011.08.008zbMath1238.05253arXiv1003.0220OpenAlexW2055970774MaRDI QIDQ409409

Lutz Warnke

Publication date: 13 April 2012

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

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

zbMATH Keywords

random graph processessmall subgraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)

Related Items (8)

The diamond-free process ⋮ Dynamic concentration of the triangle‐free process ⋮ The \(Q_2\)-free process in the hypercube ⋮ When does the K₄‐free process stop? ⋮ Large girth approximate Steiner triple systems ⋮ A note on the random greedy independent set algorithm ⋮ The C_ℓ‐free process ⋮ The Reverse H‐free Process for Strictly 2‐Balanced Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• No dense subgraphs appear in the triangle-free graph process
• Small subgraphs of random regular graphs
• The early evolution of the \(H\)-free process
• The triangle-free process
• Differential equations for random processes and random graphs
• 4-cycles at the triangle-free process
• Threshold functions for small subgraphs
• On the size of a random maximal graph
• Random maximalH-free graphs
• When does the K₄‐free process stop?
• The random planar graph process
• The C_ℓ‐free process

This page was built for publication: Dense subgraphs in the \(H\)-free process