# 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.
Turán and Ramsey-type results for unavoidable subgraphs
• Mathematics
• 2020
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 itsExpand
On edge-ordered Ramsey numbers
• Computer Science, Mathematics
• Random Struct. Algorithms
• 2020
It is proved that for every edge-ordered graph $H$ on $n$ vertices, the authors have $r_{edge}(H;q) \leq 2^{c^qn^{2q-2}\log^q n}$, where $c$ is an absolute constant. Expand
Cycle-Complete Ramsey Numbers
• Mathematics
• International 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 ofExpand
Ordered Ramsey numbers
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 2017
It is proved that even for matchings there are labelings where the ordered Ramsey number is superpolynomial in the number of vertices and a general upper bound on ordered Ramsey numbers is proved. Expand
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) ≤ ∆ holdExpand
On 1-subdivisions of transitive tournaments
The oriented Ramsey number ~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 1-subdivision of theExpand
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 growExpand
Covering 2-colored complete digraphs by monochromatic $d$-dominating digraphs
• Mathematics
• 2021
A digraph is d-dominating if every set of at most d vertices has a common outneighbor. For all integers d ≥ 2, let f(d) be the smallest integer such that the vertices of every 2-edge-colored (finiteExpand
On the multicolor Ramsey number of a graph with m edges
• Computer Science, Mathematics
• Discret. Math.
• 2016
An upper bound is proved on r k ( F) for a graph F with m edges and no isolated vertices of the form k 6 k m 2 / 3 addressing a question of Sudakov (2011). Expand
On Ramsey numbers of hedgehogs
• Computer Science, Mathematics
• Combinatorics, Probability and Computing
• 2019
Conlon, Fox and Rödl proved that the two-colour Ramsey number of the hedgehog Ht grows polynomially in the number of its vertices, while the four- Colour Ramsey number grows exponentially in the square root of theNumber of vertices. Expand

#### References

SHOWING 1-10 OF 43 REFERENCES
Recent developments in graph Ramsey theory
• Mathematics, Computer Science
• Surveys 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. Expand
The Ramsey number of a graph with bounded maximum degree
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 1983
Abstract The Ramsey number of a graph G is the least number t for which it is true that whenever the edges of the complete graph on t vertices are colored in an arbitrary fashion using two colors,Expand
A conjecture of Erdős on graph Ramsey numbers
Abstract The Ramsey number r ( G ) of a graph G is the minimum N such that every red–blue coloring of the edges of the complete graph on N vertices contains a monochromatic copy of G . Determining orExpand
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 integerExpand
On two problems in graph Ramsey theory
• Mathematics, Computer Science
• 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. Expand
On graphs with small Ramsey numbers
• Computer Science, 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. Expand
Two remarks on the Burr-Erdos conjecture
• Computer Science, Mathematics
• Eur. J. Comb.
• 2009
It is shown that for such graphs r(H)@?2^c^"^d^l^o^g^nn, improving on an earlier bound of Kostochka and Sudakov, the Ramsey number of random graphs G(n,d/n) has Ramsey number linear in n. Expand
Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• Computer Science, 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. Expand
On Bipartite Graphs with Linear Ramsey Numbers
• Mathematics, Computer Science
• Comb.
• 2001
It is shown that for all and there exists a bipartite graph with n vertices and maximum degree at most whose ramsey number is greater than for some absolute constant c>1. Expand
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 coloredExpand