On characterizing the critical graphs for matching Ramsey numbers
نویسندگان
چکیده
منابع مشابه
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...
متن کاملStar-critical Ramsey numbers
The graph Ramsey number R(G,H) is the smallest integer r such that every 2-coloring of the edges of Kr contains either a red copy of G or a blue copy of H . We find the largest star that can be removed from Kr such that the underlying graph is still forced to have a red G or a blue H . Thus, we introduce the star-critical Ramsey number r∗(G,H) as the smallest integer k such that every 2-colorin...
متن کاملAnti-Ramsey numbers of doubly edge-critical graphs
Given a graph H and a positive integer n, Anti-Ramsey number AR(n,H) is the maximum number of colors in an edge-coloring of Kn that contains no polychromatic copy of H. The anti-Ramsey numbers were introduced in the 1970s by Erd” os, Simonovits, and Sós, who among other things, determined this function for cliques. In general, few exact values of AR(n,H) are known. Let us call a graph H doubly ...
متن کاملOn graphs with linear Ramsey numbers
For a ®xed graph H, the Ramsey number r (H ) is de®ned 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 H(n, ) denote the class of graphs H having n vertices and maximum degree at most . It was shown by Chvata l, RoÈdl, SzemereÂdi, and Trotter that for each there exists c ( ) such that r (H )< c ( )n...
متن کامل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(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2020
ISSN: 0166-218X
DOI: 10.1016/j.dam.2020.07.001