Multicolour Bipartite Ramsey Number of Paths
نویسندگان
چکیده
منابع مشابه
The Multicolour Ramsey Number of a Long Odd Cycle
For a graph G, the k-colour Ramsey number Rk(G) is the least integer N such that every k-colouring of the edges of the complete graph KN contains a monochromatic copy of G. Bondy and Erdős conjectured that for an odd cycle Cn on n > 3 vertices, Rk(Cn) = 2 k−1(n− 1) + 1. This is known to hold when k = 2 and n > 3, and when k = 3 and n is large. We show that this conjecture holds asymptotically f...
متن کامل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...
متن کاملOn Multicolor Ramsey Number of Paths Versus Cycles
Let G1, G2, . . . , Gt be graphs. The multicolor Ramsey number R(G1, G2, . . . , Gt) is the smallest positive integer n such that if the edges of a complete graph Kn are partitioned into t disjoint color classes giving t graphs H1,H2, . . . ,Ht, then at least one Hi has a subgraph isomorphic to Gi. In this paper, we provide the exact value of R(Pn1 , Pn2 , . . . , Pnt , Ck) for certain values o...
متن کاملThe Ramsey number of paths with respect to wheels
For graphs G and H , the Ramsey number R(G,H) is the smallest positive integer n such that every graph F of order n contains G or the complement of F contains H . For the path Pn and the wheel Wm, it is proved that R(Pn,Wm) = 2n − 1 if m is even, m 4, and n (m/2)(m − 2), and R(Pn,Wm)= 3n− 2 if m is odd, m 5, and n (m− 1/2)(m− 3). © 2005 Elsevier B.V. All rights reserved.
متن کاملThe Ramsey Number of Loose Paths in 3-Uniform Hypergraphs
Recently, asymptotic values of 2-color Ramsey numbers for loose cycles and also loose paths were determined. Here we determine the 2-color Ramsey number of 3-uniform loose paths when one of the paths is significantly larger than the other: for every n > ⌊ 5m 4 ⌋ , we show that R(P n,P m) = 2n + ⌊m + 1 2 ⌋ .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2019
ISSN: 1077-8926
DOI: 10.37236/8458