Tree-Ramsey numbers
نویسندگان
چکیده
We denote by r'( G I , G2 ) the ramsey number of two graphs and G2 • If Tp+l is a tree of order p + 1 which is not a star, and if jJ is not a divisor of the positive integer q 1, then we shall show that r(Tp+b ](l,q) ::; p + q 1, and we shall describe some trees and stars for which equality holds. Furthermore. we detf'rmine the ramsey numbers r(T;+l' Tq*+l) for p, q ~ 4, where T~ denotes a tree of order n with f}.(T~) = n 2.
منابع مشابه
The Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملGeneralized Ramsey theorems for r-uniform hypergraphs
We show that several known Ramsey number inequalities can be extended to the setting of r-uniform hypergraphs. In particular, we extend Burr’s results on tree-star Ramsey numbers, providing exact evaluations for certain hypergraph Ramsey numbers. Then we turn our attention to proving a general multicolor hypergraph Ramsey number inequality from which generalizations of results due to Chvátal an...
متن کاملThe Ramsey numbers of trees versus W6 or W7
1 Let Tn denote a tree of order n and Wm a wheel of order m+1. In this paper, we show the Ramsey 2 numbers R(Tn , W6) = 2n − 1 + μ for n ≥ 5, where μ = 2 if Tn = Sn, μ = 1 if Tn = Sn(1, 1) or 3 Tn = Sn(1, 2) and n ≡ 0 (mod 3), and μ = 0 otherwise; R(Tn , W7) = 3n − 2 for n ≥ 6. 4 © 2005 Elsevier Ltd. All rights reserved. 5
متن کاملMonochromatic tree covers and Ramsey numbers for set-coloured graphs
We extend results on monochromatic tree covers and from classical Ramsey theory to a generalised setting, where each of the edges of an underlying host graph (here, either a complete graph or a complete bipartite graph), is coloured with a set of colours. Our results for tree covers in this setting have an application to Ryser’s Conjecture. Every r-partite r-uniform hypergraph whose edges pairw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 11 شماره
صفحات -
تاریخ انتشار 1995