The Final Size of the $C_{\ell}$-free Process

DOI10.1137/110824097zbMath1305.05211OpenAlexW2001777586MaRDI QIDQ2935270

Michael E. Picollelli

Publication date: 22 December 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110824097

zbMATH Keywords

randomized greedy algorithmdifferential equations method\(H\)-free process

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Vertex degrees (05C07)

Related Items (9)

On the Random Greedy $F$-Free Hypergraph Process ⋮ On the power of random greedy algorithms ⋮ On the random greedy \(F\)-free hypergraph process ⋮ Dynamic concentration of the triangle‐free process ⋮ A randomized construction of high girth regular graphs ⋮ The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\) ⋮ The sum-free process ⋮ Large girth approximate Steiner triple systems ⋮ A note on the random greedy independent set algorithm

This page was built for publication: The Final Size of the $C_{\ell}$-free Process