Packing nearly optimal Ramsey \(R(3,t)\) graphs

DOI10.1007/s00493-019-3921-7zbMath1474.05275arXiv1711.05877OpenAlexW2768930897MaRDI QIDQ2182253

Lutz Warnke, He Guo

Publication date: 22 May 2020

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey numbertriangle-free graphedge-disjoint collection

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles ⋮ Two problems in graph Ramsey theory ⋮ On the power of random greedy algorithms ⋮ Minimal Ramsey Graphs with Many Vertices of Small Degree ⋮ A gentle introduction to the differential equation method and dynamic concentration ⋮ The minimum degree of minimal Ramsey graphs for cliques ⋮ Bounds on Ramsey games via alterations ⋮ Dense induced bipartite subgraphs in triangle-free graphs ⋮ Large girth approximate Steiner triple systems ⋮ On minimal Ramsey graphs and Ramsey equivalence in multiple colours

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimum degree of minimal Ramsey graphs for multiple colours
• The early evolution of the \(H\)-free process
• The triangle-free process
• A note on Ramsey numbers
• A dense infinite Sidon sequence
• The size Ramsey number
• Asymptotic lower bounds for Ramsey functions
• Nearly perfect matchings in regular simple hypergraphs
• Upper tails for arithmetic progressions in random subsets
• Asymptotically good list-colorings
• The diamond-free process
• On the minimum degree of minimal Ramsey graphs
• Recent developments in graph Ramsey theory
• Graph Theory and Probability. II
• The minimum degree of Ramsey-minimal graphs
• On Ramsey Minimal Graphs
• On the size of a random maximal graph
• On size Ramsey number of paths, trees, and circuits. I
• Random maximalH-free graphs
• Bounding Ramsey numbers through large deviation inequalities
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• On the Method of Typical Bounded Differences
• Triangle‐free subgraphs in the triangle‐free process
• When does the K₄‐free process stop?
• Dynamic concentration of the triangle-free process
• The C_ℓ‐free process
• Some remarks on the theory of graphs
• On size Ramsey numbers of graphs with bounded degree