# On graphs with linear Ramsey numbers

```@article{Graham2000OnGW,
title={On graphs with linear Ramsey numbers},
author={Ronald L. Graham and Vojtech R{\"o}dl and Andrzej Rucinski},
journal={J. Graph Theory},
year={2000},
volume={35},
pages={176-192}
}```
• Published 1 November 2000
• Mathematics
• J. Graph Theory
For a fixed graph H, the Ramsey number r(H) is defined to be the least integer N such that in any 2-coloring of the edges of the complete graph KN, some monochromatic copy of H is always formed. Let 𝓗(n, Δ) denote the class of graphs H having n vertices and maximum degree at most Δ. It was shown by Chvatal, Rodl, Szemeredi, and Trotter that for each ” there exists c(Δ) such that r(H) 0, and for all n and Δ, there are graphs H2 e𝓗 (n, Δ) with r(H2) > 2c2Δn, which is not so far from our upper…
68 Citations

### Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions

• Mathematics
Combinatorics, Probability and Computing
• 2003
It is proved that, for any fixed bipartite graph H in which all degrees in one colour class are at most r, the Turán number is the maximum possible number of edges in a simple graph on n vertices that contains no copy of H.

### On two problems in graph Ramsey theory

• Mathematics
Comb.
• 2012
This work improves the upper bound on the existence of a constant c such that, for any graph H on n vertices, rind(H) ≤ 2cnlogn, and moves a step closer to proving this conjecture.

### Some problems in Graph Ramsey Theory

A graph G is r-Ramsey minimal with respect to a graph H if every r-coloring of the edges of G yields a monochromatic copy of H, but the same is not true for any proper subgraph of G. The study of the

### On Ramsey Numbers of Sparse Graphs

• Mathematics
Combinatorics, Probability and Computing
• 2003
It is shown that, for every , sufficiently large n, and any graph H of order , either H or its complement contains a (d,n)-common graph, that is, a graph in which every set of d vertices has at least n common neighbours.

### Ordered Ramsey numbers

• Mathematics
J. Comb. Theory, Ser. B
• 2017

### Cube Ramsey numbers are polynomial

It is shown that for any positive constant c and bipartite graph G=(U, V; E) of order n where the maximum degree of vertices in U is at most, the Ramsey number of the n-cube Qn satisfies which improves the bound 2cn log n due to Graham, Rodl, and Rucinski.

### The Ramsey number of dense graphs

The Ramsey number r(H) of a graph H is the smallest number n such that, in any two‐colouring of the edges of Kn, there is a monochromatic copy of H. We study the Ramsey number of graphs H with t

### Cycles Are Strongly Ramsey-Unsaturated

• Mathematics
Combinatorics, Probability and Computing
• 2014
It is shown that one may add any chord without changing the Ramsey number of the cycle Cn, unless n is even and adding the chord creates an odd cycle, and this conjecture is proved by showing a stronger statement.

## References

SHOWING 1-10 OF 21 REFERENCES

### On graphs with small Ramsey numbers

• Mathematics
• 2001
Let R(G) denote the minimum integer N such that for every bicoloring of the edges of KN, at least one of the monochromatic subgraphs contains G as a subgraph. We show that for every positive integer

### On graphs with small Ramsey numbers *

• Mathematics
J. Graph Theory
• 2001
It is shown that for every positive integer d and each,0< <1, there exists k k (d, ) such that forevery bipartite graph G (W,U;E ) with the maximum degree of vertices in W at most d and jU j j jW j, R (G ) k jWJ.

### Induced Ramsey Numbers

• Mathematics
Comb.
• 1998
The induced Ramsey number of pairs of graphs (G, H) is investigated to be the smallest possible order of a graph Γ with the property that, whenever its edges are coloured red and blue, either a red induced copy of G arises or else a blue induced copies of H arises.

### ON THE MAGNITUDE OF GENERALIZED RAMSEY NUMBERS FOR GRAPHS

If G and H are graphs (which will mean finite, with no loops or parallel lines), define the Ramsey number r(G, H) to be the least number p such that if the lines of the complete graph Kp are colored

### Graphs with Linearly Bounded Ramsey Numbers

• Mathematics
J. Comb. Theory, Ser. B
• 1993
It is proved that for each p ≥ 1, there is a constant c (depending only on p) such that the Ramsey number r ( G, G ) ≤ cn for eachp -arrangeable graph G of order n.

### Planar Graph Coloring with an Uncooperative Partner

• Mathematics
Planar Graphs
• 1991
It is shown that the game chromatic number of a planar graph is at most 33 and the concept of p-arrangeability, which was first introduced by Guantao and Schelp in a Ramsey theoretic setting, is bounded in terms of its genus.

### Subdivided graphs have linear ramsey numbers

• N. Alon
• Mathematics
J. Graph Theory
• 1994
It is shown that the Ramsey number of any graph with n vertices in which no two vertices of degree at least 3 are adjacent is at most 12n, which settles the problem of Burr and Erdos.

### Regular Partitions of Graphs

Abstract : A crucial lemma in recent work of the author (showing that k-term arithmetic progression-free sets of integers must have density zero) stated (approximately) that any large bipartite graph