Triangle‐free subgraphs in the triangle‐free process
From MaRDI portal
Publication:5388974
DOI10.1002/rsa.20378zbMath1238.05254arXiv0903.1756MaRDI QIDQ5388974
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
05C80: Random graphs (graph-theoretic aspects)
Related Items
Generating Random Networks Without Short Cycles, Large girth approximate Steiner triple systems, The Reverse H‐free Process for Strictly 2‐Balanced Graphs, When does the K4‐free process stop?, The Cℓ‐free process, Dynamic concentration of the triangle‐free process, Packing nearly optimal Ramsey \(R(3,t)\) graphs, The \(Q_2\)-free process in the hypercube, The sum-free process, A note on the random greedy independent set algorithm, The diamond-free process
Cites Work