The Final Size of theC4-Free Process

DOI10.1017/S0963548311000368zbMath1236.05183arXiv1010.5208MaRDI QIDQ3103637

Michael E. Picollelli

Publication date: 8 December 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

stopping timesize4-cyclemaximum degreeRandom graph process

Mathematics Subject Classification ID

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

Related Items (8)

The diamond-free process ⋮ Dynamic concentration of the triangle‐free process ⋮ A randomized construction of high girth regular graphs ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ The \(Q_2\)-free process in the hypercube ⋮ 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

• The early evolution of the \(H\)-free process
• The triangle-free process
• Coloring graphs with sparse neighborhoods
• Counting extensions
• Random Graph Processes with Degree Restrictions
• On the size of a random maximal graph
• Random maximalH-free graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t

This page was built for publication: The Final Size of theC₄-Free Process