On graphs with small Ramsey numbers *

@article{Kostochka2001OnGW,
  title={On graphs with small Ramsey numbers *},
  author={Alexandr V. Kostochka and Vojtech R{\"o}dl},
  journal={Journal of Graph Theory},
  year={2001},
  volume={37}
}
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 d and each γ,0 < γ < 1, there exists k = k(d,γ) such that for every bipartite graph G = (W,U;E) with the maximum degree of vertices in W at most d and $|U|\leq |W|^{\gamma }$, $R(G)\leq k|W|$. This answers a question of Trotter. We give also a weaker bound on the Ramsey numbers of graphs whose set… 
On Ramsey Numbers of Sparse Graphs
TLDR
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.
On graphs with linear Ramsey numbers
TLDR
In this paper, the use of the regularity lemma is avoided altogether, and it is shown that one can in fact take, for some ®xed c, c… † < 2 (log )2 in the general case, and even even 1.
Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
TLDR
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.
Two remarks on the Burr-Erdos conjecture
Unavoidable patterns
Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems
  • B. Sudakov
  • Mathematics
    Random Struct. Algorithms
  • 2005
TLDR
Three Ramsey-type results are presented, which derive from a simple and yet powerful lemma, proved using probabilistic arguments and solve some special cases of a closely related question posed by Erdős.
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
TLDR
The main ingredient in the proof, which might be of independent interest, is an estimate on the order of the largest clique subdivision which one can find in every graph on n vertices with independence number α.
Ramsey numbers of sparse hypergraphs
TLDR
This work significantly improves on the Ackermann‐type upper bound that arises from the regularity proofs, and presents a construction which shows that, at least in certain cases, this bound is not far from best possible.
Topics in flnite graph Ramsey theory
For a positive integer r and graphs F , G, and H, the graph Ramsey arrow notation F −→ (G)r means that for every r-colouring of the subgraphs of F isomorphic to H, there exists a subgraph G′ of F
A few remarks on Ramsey-Tura'n-type problems
...
...

References

SHOWING 1-6 OF 6 REFERENCES
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
TLDR
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.
Subdivided graphs have linear ramsey numbers
  • N. Alon
  • Mathematics
    J. Graph Theory
  • 1994
TLDR
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.
Arrangeability and clique subdivisionsThe Mathematics of Paul Erdo }s
  • Arrangeability and clique subdivisionsThe Mathematics of Paul Erdo }s
  • 1997
Erdo}s, On the magnitude of generalized Ramsey numbers for graphs, in: `̀ In®nite and ®nite sets'
  • Colloquia Mathematica Soc. Janos Bolyai,
  • 1975