# Ramsey numbers of degenerate graphs

@article{Lee2015RamseyNO, title={Ramsey numbers of degenerate graphs}, author={Choongbum Lee}, journal={arXiv: Combinatorics}, year={2015} }

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 $H$ of chromatic number $r$ with $|V(H)| \ge 2^{d^22^{cr}}$ has Ramsey number at most $2^{d2^{cr}} |V(H)|$. This solves a conjecture of Burr and Erdős from 1973.

## 25 Citations

On 1-Subdivisions of Transitive Tournaments

- MathematicsElectron. J. Comb.
- 2022

The oriented Ramsey number $\vec{r}(H)$ for an acyclic digraph $H$ is the minimum integer $n$ such that any $n$-vertex tournament contains a copy of $H$ as a subgraph. We prove that the…

Turán‐ and Ramsey‐type results for unavoidable subgraphs

- MathematicsJournal of Graph Theory
- 2022

We study Turan and Ramsey-type problems on edge-colored graphs. An edge-colored graph is called {\em $\varepsilon$-balanced} if each color class contains at least an $\varepsilon$-proportion of its…

Cycle-Complete Ramsey Numbers

- MathematicsInternational Mathematics Research Notices
- 2019

The Ramsey number $r(C_{\ell },K_n)$ is the smallest natural number $N$ such that every red/blue edge colouring of a clique of order $N$ contains a red cycle of length $\ell $ or a blue clique of…

Tiling with monochromatic bipartite graphs of bounded maximum degree

- Mathematics
- 2021

We prove that for any r ∈ N, there exists a constant Cr such that the following is true. Let F = {F1, F2, . . . } be an infinite sequence of bipartite graphs such that |V (Fi)| = i and ∆(Fi) ≤ ∆ hold…

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…

Covering 2‐colored complete digraphs by monochromatic
d $d$ ‐dominating digraphs

- MathematicsJ. Graph Theory
- 2022

A digraph is d $d$ ‐dominating if every set of at most d $d$ vertices has a common out‐neighbor. For all integers d ≥ 2 $d\ge 2$ , let f ( d ) $f(d)$ be the smallest integer such that the vertices of…

Hedgehogs are not colour blind

- Mathematics
- 2015

We exhibit a family of $3$-uniform hypergraphs with the property that their $2$-colour Ramsey numbers grow polynomially in the number of vertices, while their $4$-colour Ramsey numbers grow…

Ramsey numbers of sparse digraphs

- Mathematics
- 2021

Burr and Erdős in 1975 conjectured, and Chvátal, Rödl, Szemerédi and Trotter later proved, that the Ramsey number of any bounded degree graph is linear in the number of vertices. In this paper, we…

## References

SHOWING 1-10 OF 42 REFERENCES

Recent developments in graph Ramsey theory

- MathematicsSurveys in Combinatorics
- 2015

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.

On graphs with small Ramsey numbers *

- MathematicsJ. 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.

The Ramsey number of a graph with bounded maximum degree

- MathematicsJ. Comb. Theory, Ser. B
- 1983

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 two problems in graph Ramsey theory

- MathematicsComb.
- 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.

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

- MathematicsCombinatorics, 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 THE MAGNITUDE OF GENERALIZED RAMSEY NUMBERS FOR GRAPHS

- Mathematics
- 1973

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…

A transference principle for Ramsey numbers of bounded degree graphs

- Mathematics
- 2015

We investigate Ramsey numbers of bounded degree graphs and provide an interpolation between known results on the Ramsey numbers of general bounded degree graphs and bounded degree graphs of small…