Triangle‐free subgraphs in the triangle‐free process

DOI10.1002/rsa.20378zbMath1238.05254arXiv0903.1756OpenAlexW2164331940MaRDI QIDQ5388974

Guy Wolfovitz

Publication date: 24 April 2012

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

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

zbMATH Keywords

random graphtriangle-free processsubgraph count

Mathematics Subject Classification ID

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

Related Items (11)

The diamond-free process ⋮ Packing nearly optimal Ramsey \(R(3,t)\) graphs ⋮ Dynamic concentration of the triangle‐free process ⋮ The \(Q_2\)-free process in the hypercube ⋮ When does the K₄‐free process stop? ⋮ The sum-free process ⋮ Large girth approximate Steiner triple systems ⋮ Generating Random Networks Without Short Cycles ⋮ 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

This page was built for publication: Triangle‐free subgraphs in the triangle‐free process