Dynamic concentration of the triangle‐free process

DOI10.1002/rsa.20973zbMath1522.05287OpenAlexW4212798546MaRDI QIDQ6073629

Peter Keevash, Tom Bohman

Publication date: 11 October 2023

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

Full work available at URL: https://doi.org/10.1002/rsa.20973

zbMATH Keywords

Ramsey numberstriangle-free graphdynamic concentration

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Generalized Ramsey theory (05C55)

Related Items (11)

On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles ⋮ On the power of random greedy algorithms ⋮ A gentle introduction to the differential equation method and dynamic concentration ⋮ Counting extensions revisited ⋮ Bounds on Ramsey games via alterations ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Off-diagonal book Ramsey numbers ⋮ A variant of the Erdős–Rényi random graph process ⋮ The asymptotics of \(r(4,t)\) ⋮ Prominent examples of flip processes ⋮ Ramsey-Turán problems with small independence numbers

Cites Work

• Unnamed Item
• Dense subgraphs in the \(H\)-free process
• A note on the random greedy triangle-packing algorithm
• No dense subgraphs appear in the triangle-free graph process
• Handbook of large-scale random networks
• The early evolution of the \(H\)-free process
• Lower bounds for the size of random maximal \(H\)-free graphs
• The triangle-free process
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• On tail probabilities for martingales
• Asymptotic lower bounds for Ramsey functions
• Explicit Ramsey graphs and orthonormal labelings
• Constrainted graph processes
• Random triangle removal
• Counting extensions
• The diamond-free process
• The Final Size of the $C_{\ell}$-free Process
• Introduction to Random Graphs
• A note on regular Ramsey graphs
• The Final Size of theC₄-Free Process
• Graph Theory and Probability. II
• Random Graph Processes with Degree Restrictions
• On the size of a random maximal graph
• Random maximalH-free graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• Triangle‐free subgraphs in the triangle‐free process
• When does the K₄‐free process stop?
• The C_ℓ‐free process
• Concentration of multivariate polynomials and its applications

This page was built for publication: Dynamic concentration of the triangle‐free process