A note on the random greedy triangle-packing algorithm
From MaRDI portal
Publication:547873
DOI10.4310/JOC.2010.v1.n4.a5zbMath1244.05213arXiv1004.2418OpenAlexW2963656439MaRDI QIDQ547873
Eyal Lubetzky, Tom Bohman, Alan M. Frieze
Publication date: 27 June 2011
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.2418
Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Triple systems (05B07)
Related Items (10)
The sharp threshold for making squares ⋮ A gentle introduction to the differential equation method and dynamic concentration ⋮ Dynamic concentration of the triangle‐free process ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ Unnamed Item ⋮ Large girth approximate Steiner triple systems ⋮ A natural barrier in random greedy hypergraph matching ⋮ Discrepancy of high-dimensional permutations ⋮ A note on the random greedy independent set algorithm ⋮ Random triangle removal
This page was built for publication: A note on the random greedy triangle-packing algorithm
