The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\)

DOI10.37236/9101zbMath1451.05151arXiv1808.02139OpenAlexW3096364714MaRDI QIDQ2209894

Patrick Bennett, Deepak Bal

Publication date: 5 November 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

bipartite independence number of a graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (1)

A gentle introduction to the differential equation method and dynamic concentration

Cites Work

• Unnamed Item
• Unnamed Item
• The independent neighborhoods process
• The early evolution of the \(H\)-free process
• The triangle-free process
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• On tail probabilities for martingales
• A note on the random greedy independent set algorithm
• The diamond-free process
• The Final Size of the $C_{\ell}$-free Process
• Eighty Years of RamseyR(3, k)…and Counting!
• A new upper bound for the bipartite Ramsey problem
• Random Graph Processes with Degree Restrictions
• On the size of a random maximal graph
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• Dynamic concentration of the triangle-free process
• The C_ℓ‐free process
• On a problem of K. Zarankiewicz
• Asymptotic bounds for bipartite Ramsey numbers

This page was built for publication: The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\)