No dense subgraphs appear in the triangle-free graph process

zbMath1229.05249arXiv1002.2316MaRDI QIDQ640423

Tamás Makai, Stefanie Gerke

Publication date: 18 October 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (8)

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

This page was built for publication: No dense subgraphs appear in the triangle-free graph process