The diamond-free process

DOI10.1002/rsa.20517zbMath1303.05179arXiv1010.5207OpenAlexW2058494942MaRDI QIDQ2930059

Michael E. Picollelli

Publication date: 17 November 2014

Published in: Random Structures & Algorithms, Random Structures \& Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

uniform random graphdiamond graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (9)

On the Random Greedy $F$-Free Hypergraph Process ⋮ On the random greedy \(F\)-free hypergraph process ⋮ Packing nearly optimal Ramsey \(R(3,t)\) graphs ⋮ Dynamic concentration of the triangle‐free process ⋮ On some generalized vertex Folkman numbers ⋮ The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\) ⋮ The sum-free process ⋮ A note on the random greedy independent set algorithm ⋮ The Reverse H‐free Process for Strictly 2‐Balanced Graphs

Cites Work

• Dense subgraphs in the \(H\)-free process
• No dense subgraphs appear in the triangle-free graph process
• The early evolution of the \(H\)-free process
• Lower bounds for the size of random maximal \(H\)-free graphs
• The triangle-free process
• The Final Size of theC₄-Free Process
• 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
• Triangle‐free subgraphs in the triangle‐free process

This page was built for publication: The diamond-free process