Erratum to: On Ramsey Numbers for Arbitrary Sequences of Graphs
نویسندگان
چکیده
An Erratum to this paper has been published: https://doi.org/10.1134/S1064562422340014
منابع مشابه
On 1-dependent ramsey numbers for graphs
A set X of vertices of a graph G is said to be 1-dependent if the subgraph of G induced by X has maximum degree one. The 1-dependent Ramsey number t1(l, m) is the smallest integer n such that for any 2-edge colouring (R, B) of Kn, the spanning subgraph B of Kn has a 1-dependent set of size l or the subgraph R has a 1-dependent set of size m. The 2-edge colouring (R, B) is a t1(l, m) Ramsey colo...
متن کاملOn Ramsey Numbers of Sparse Graphs
The Ramsey number, r(G), of a graph G is the minimum integer N such that, in every 2-colouring of the edges of the complete graph KN on N vertices, there is a monochromatic copy of G. In 1975, Burr and Erdős posed a problem on Ramsey numbers of d-degenerate graphs, i.e., graphs in which every subgraph has a vertex of degree at most d. They conjectured that for every d there exists a constant c(...
متن کاملOn Pattern Ramsey Numbers of Graphs
A color pattern is a graph whose edges are partitioned into color classes. A family F of color patterns is a Ramsey family if there is some integer N such that every edgecoloring of KN has a copy of some pattern in F . The smallest such N is the (pattern) Ramsey number R(F ) of F . The classical Canonical Ramsey Theorem of Erdős and Rado [4] yields an easy characterization of the Ramsey familie...
متن کاملRamsey numbers of degenerate graphs
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 G of chromatic number r has Ramsey number at most 2 cr |V (G)|. This solves a conjecture of Burr and Erdős from 1973.
متن کاملConstrained Ramsey numbers of graphs
Given two graphs G and H, let f (G,H) denote the minimum integer n such that in every coloring of the edges of Kn, there is either a copy of G with all edges having the same color or a copy of H with all edges having different colors. We show that f (G,H) is finite iff G is a star or H is acyclic. If S and T are trees with s and t edges, respectively, we show that 1þ s (t 2)/2 f (S,T ) (s 1)(t ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Doklady Mathematics
سال: 2022
ISSN: ['1064-5624', '1531-8362']
DOI: https://doi.org/10.1134/s1064562422340014