For graphs G(1), ..., G(s), the multicolor Ramsey number R(G(1), ..., G(s)) is the smallest integer r such that if we give any edge coloring of the complete graph on r vertices with s colors then there exists a monochromatic copy of G, colored with color i, for some 1 ...
The Ramsey numbers for stars of even order versus a wheel of order nine For two given graphs G1and G2, the Ramsey number R(G1, G2) is the smallest positive integer n such that for any graph G of order n, either G contains G1or ... Y Zhang,TCE Cheng,Y Chen - 《Journal of ...
On zero-sum Ramsey numbers— stars Let nk2 be positive integers, k|n. Let <###next line###>k be the cyclic group of order k. Denote by <###next line###> the minimal integer t such that for every <###next line###>k-coloring of the edges of Kt, (i.e., a function <#...
WITHDRAWN: On the Ramsey numbers R(p,q)≥R(p−1,q+1)(3≤p≤q) R ( p , q ) ≥ R ( p − 1 , q + 1 ) ( 3 ≤ p ≤ q ) mathContainer Loading Mathjax This article has been withdrawn consistent with Elsevier Policy on Article Withdrawal ( http://www.elsevier.com/loca...
Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle Summary: The Ramsey number for a graph $G$ versus a graph $H$, denoted by $R(G,H)$, is the smallest positive integer $n$ such that for any graph $F$ of ord... Hasmawati,H Assiyatun,ET Baskoro,... - Computati...
On the Erdös-Ginzburg-Ziv Theorem and the Ramsey numbers for stars and matchings A link between Ramsey numbers for stars and matchings and the Erdos-Ginzburg-Ziv theorem is established. Known results are generalized. Among other results we prove the following two theorems. Theorem 5. Let m ...
Withdrawn Article in PressWhat’s this? WITHDRAWN: On the Ramsey numbersR(p,q)≥R(p−1,q+1)(3≤p≤q) Author links open overlay panel,, Show more Add to Mendeley Share Cite https://doi.org/10.1016/j.disc.2008.03.010 This article has been withdrawn consistent with Elsevier Policy on...
Ramsey numberTreeGeneralised wheel graphsGiven two simple graphs G and H, the Ramsey number R(G,H) is the smallest integer n such that for any graph of order n, either it contains G or its complement contains H. Let Tn be a tree graph of order n and Ws,m be the generalised wheel ...
摘要: In this paper we survey the authors' recent results on quantitative extensions of Ramsey theory. In particular, we discuss our recent results on Folkman numbers, induced bipartite Ramsey graphs, and explicit constructions of Ramsey graphs.关键词: Ramsey-type numbers Folkman numbers ...
On star-wheel Ramsey numbers 来自 钛学术 喜欢 0 阅读量: 44 发明人: B Li,I Schiermeyer 摘要: For two given graphs $G_1$ and $G_2$, the Ramsey number $R(G_1,G_2)$ is the least integer $r$ such that for every graph $G$ on $r$ vertices, either $G$ contains a $G_...