The Ramsey number 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 …

Ramsey theory is named after British mathematician Frank P. Ramsey (February 22, 1903–
January 19, 1930) who published a paper “On a problem of formal logic” in 1929. Ramsey …

The book graph consists of copies of joined along a common. In the prequel to this paper,
we studied the diagonal Ramsey number. Here we consider the natural off-diagonal variant …

The Ramsey multiplicity constant of a graph $ H $ is the limit as $ n $ tends to infinity of the
minimum density of monochromatic labelled copies of $ H $ in a colouring of the edges of …

For graphs F, G and H, let F→(G, H) signify that any red/blue edge coloring of F contains
either a red G or a blue H. The Ramsey number r (G, H) is defined to be the smallest integer …

A classical result of Chvátal implies that if n≥(r− 1)(t− 1)+ 1, then any colouring of the edges
of K n in red and blue contains either a monochromatic red K r or a monochromatic blue P t …

A Berge copy of a graph is a hypergraph obtained by enlarging the edges arbitrarily. Grósz,
Methuku and Tompkins in 2020 showed that for any graph F, there is an integer r 0= r 0 (F) …

Abstract In 1983, Burr and Erdős initiated the study of Ramsey goodness problems. Nikiforov
and Rousseau (2009) resolved almost all goodness questions raised by Burr and Erdős, in …

On a conjecture of Conlon, Fox, and Wigderson Page 1 Combinatorics, Probability and
Computing (2024), 1–14 doi:10.1017/S0963548324000026 ARTICLE On a conjecture of …

For graphs $ G $ and $ H $, the Ramsey number $ r (G, H) $ is the smallest positive integer
$ N $ such that any red/blue edge coloring of the complete graph $ K_N $ contains either a …