# Recent developments in graph Ramsey theory

```@inproceedings{Conlon2015RecentDI,
title={Recent developments in graph Ramsey theory},
author={David Conlon and Jacob Fox and Benny Sudakov},
booktitle={Surveys in Combinatorics},
year={2015}
}```
• Published in Surveys in Combinatorics 11 January 2015
• Mathematics
Given a graph \$H\$, the Ramsey number \$r(H)\$ is the smallest natural number \$N\$ such that any two-colouring of the edges of \$K_N\$ contains a monochromatic copy of \$H\$. The existence of these numbers has been known since 1930 but their quantitative behaviour is still not well understood. Even so, there has been a great deal of recent progress on the study of Ramsey numbers and their variants, spurred on by the many advances across extremal combinatorics. In this survey, we will describe some of…
140 Citations

### A Survey of Hypergraph Ramsey Problems

• Mathematics
Springer Optimization and Its Applications
• 2020
The classical hypergraph Ramsey number \$r_k(s,n)\$ is the minimum \$N\$ such that for every red-blue coloring of the \$k\$-tuples of \$\{1,\ldots, N\}\$, there are \$s\$ integers such that every \$k\$-tuple

### Three early problems on size Ramsey numbers

• Mathematics
• 2021
The size Ramsey number of a graph H is defined as the minimum number of edges in a graph G such that there is a monochromatic copy of H in every two-coloring of E(G). The size Ramsey number was

### Ramsey numbers of degenerate graphs

A graph is \$d\$-degenerate if all its subgraphs have a vertex of degree at most \$d\$. We prove that there exists a constant \$c\$ such that for all natural numbers \$d\$ and \$r\$, every \$d\$-degenerate graph

### The minimum degree of minimal Ramsey graphs for cliques

• Mathematics
Bulletin of the London Mathematical Society
• 2022
We prove that \$s_r(K_k) = O(k^5 r^{5/2})\$, where \$s_r(K_k)\$ is the Ramsey parameter introduced by Burr, Erdős and Lovasz in 1976, which is defined as the smallest minimum degree of a graph \$G\$ such

### Ramsey numbers of cycles versus general graphs

• Mathematics
• 2021
The Ramsey number R(F,H) is the minimum number N such that any N -vertex graph either contains a copy of F or its complement contains H . Burr in 1981 proved a pleasingly general result that for any

### Density of monochromatic infinite subgraphs II

• Mathematics
• 2020
In 1967, Gerencser and Gyarfas proved the following seminal result in graph-Ramsey theory: every 2-colored \$K_n\$ contains a monochromatic path on \$\lceil(2n+1)/3\rceil\$ vertices, and this is best

### Anti-Ramsey multiplicities

• Mathematics
Australas. J Comb.
• 2019
Anti-Ramsey multiplicity is investigated for several families of graphs, finding classes of graphs which are either anti-common or not, and the rainbow equivalent of Sidorenko's conjecture, that all bipartite graphs are anti- common, is false.

### Ramsey numbers with prescribed rate of growth

• Mathematics
• 2022
. Let R ( G ) be the two-colour Ramsey number of a graph G . In this note, we prove that for any non-decreasing function n 6 f ( n ) 6 R ( K n ), there exists a sequence of connected graphs ( G n ) n

### A Note on Induced Ramsey Numbers

• Mathematics
• 2017
The induced Ramsey number r ind(F) of a k-uniform hypergraph F is the smallest natural number n for which there exists a k-uniform hypergraph G on n vertices such that every two-coloring of the edges