Random triangle removal

DOI10.1016/j.aim.2015.04.015zbMath1312.05123arXiv1203.4223OpenAlexW2964282678WikidataQ57401414 ScholiaQ57401414MaRDI QIDQ2346047

Tom Bohman, Eyal Lubetzky, Alan M. Frieze

Publication date: 29 May 2015

Published in: Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random graphsrandom graph processestriangle packingtriangle free graphsself-correcting stochastic processes

Mathematics Subject Classification ID

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

Related Items (21)

Counting Steiner triple systems ⋮ The sharp threshold for making squares ⋮ A Random Triadic Process ⋮ A gentle introduction to the differential equation method and dynamic concentration ⋮ Friendly bisections of random graphs ⋮ Dynamic concentration of the triangle‐free process ⋮ Counting extensions revisited ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ Large deviations in random latin squares ⋮ Prominent examples of flip processes ⋮ On the Method of Typical Bounded Differences ⋮ Unnamed Item ⋮ On a conjecture of Erdős on locally sparse Steiner triple systems ⋮ Coloured and Directed Designs ⋮ Balancing sums of random vectors ⋮ Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process ⋮ On the threshold problem for Latin boxes ⋮ Large girth approximate Steiner triple systems ⋮ A natural barrier in random greedy hypergraph matching ⋮ A note on the random greedy independent set algorithm ⋮ Large triangle packings and Tuza’s conjecture in sparse random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the random greedy triangle-packing algorithm
• The early evolution of the \(H\)-free process
• The triangle-free process
• On a packing and covering problem
• On tail probabilities for martingales
• Nearly perfect matchings in regular simple hypergraphs
• On random greedy triangle packing
• Asymptotically optimal covering designs
• To Prove and Conjecture: Paul Erdos and His Mathematics
• On the size of a random maximal graph
• Asymptotic packing via a branching process

This page was built for publication: Random triangle removal