Bounds for two multicolor Ramsey numbers concerning quadrilaterals
X Zhang, Y Chen, TCE Cheng - Finite Fields and Their Applications, 2022 - Elsevier
For k given graphs H 1,…, H k, k≥ 2, the k-color Ramsey number, denoted by R (H 1,…, H
k), is the smallest integer N such that if we arbitrarily color the edges of a complete graph of …
k), is the smallest integer N such that if we arbitrarily color the edges of a complete graph of …
A remark on star-C4 and wheel-C4 Ramsey numbers
Y Zhang, H Broersma, Y Chen - Electronic Journal of Graph Theory and …, 2014 - ejgta.org
Given two graphs G1 and G2, the Ramsey number R (G1, G2) is the smallest integer N such
that, for any graph G of order N, either G1 is a subgraph of G, or G2 is a subgraph of the …
that, for any graph G of order N, either G1 is a subgraph of G, or G2 is a subgraph of the …
[HTML][HTML] A theorem on cycle–wheel Ramsey number
For two given graphs G1 and G2, the Ramsey number R (G1, G2) is the smallest integer N
such that for any graph G of order N, either G contains G1 or the complement of G contains …
such that for any graph G of order N, either G contains G1 or the complement of G contains …
[HTML][HTML] The Ramsey numbers for cycles versus wheels of odd order
For two given graphs G1 and G2, the Ramsey number R (G1, G2) is the smallest integer n
such that for any graph G of order n, either G contains G1 or the complement of G contains …
such that for any graph G of order n, either G contains G1 or the complement of G contains …
A note on the Ramsey numbers for theta graphs versus the wheel of order
The study of exact values and bounds on the Ramsey numbers of graphs forms an important
family of problems in the extremal graph theory. For a set of graphs S and a graph F, the …
family of problems in the extremal graph theory. For a set of graphs S and a graph F, the …
Ramsey numbers involving cycles
SP Radziszowski - Ramsey Theory: Yesterday, Today, and Tomorrow, 2011 - Springer
There is a vast amount of literature on Ramsey-type problems starting in 1930 with the
original paper of Ramsey [Ram]. Graham, Rothschild and Spencer in their book, Ramsey …
original paper of Ramsey [Ram]. Graham, Rothschild and Spencer in their book, Ramsey …
All quadrilateral-wheel planar Ramsey numbers
Y Chen, Z Miao, G Zhou - Graphs and Combinatorics, 2017 - Springer
For two given graphs G_1 G 1 and G_2 G 2, the planar Ramsey number PR (G_1, G_2) PR
(G 1, G 2) is the smallest integer n such that every planar graph G on n vertices either …
(G 1, G 2) is the smallest integer n such that every planar graph G on n vertices either …
Three results on cycle-wheel Ramsey numbers
Y Zhang, H Broersma, Y Chen - Graphs and Combinatorics, 2015 - Springer
Given two graphs G_1 G 1 and G_2 G 2, the Ramsey number R (G_1, G_2) R (G 1, G 2) is
the smallest integer NN such that, for any graph GG of order NN, either G_1 G 1 is a …
the smallest integer NN such that, for any graph GG of order NN, either G_1 G 1 is a …
All complete graph-wheel planar Ramsey numbers
Y Zhang, G Zhou, Y Chen - Graphs and Combinatorics, 2015 - Springer
For two given graphs G_1 G 1 and G_2 G 2, the planar Ramsey number PR (G_1, G_2) PR
(G 1, G 2) is the smallest integer NN such that for any planar graph GG of order NN, either …
(G 1, G 2) is the smallest integer NN such that for any planar graph GG of order NN, either …
[PDF][PDF] Computation of Ramsey Numbers R (C, W,)
L Luo, M Liang, Z Li - 2012 - combinatorialpress.com
For given finite simple graphs F and G, the Ramsey number R (F, G) is the minimum positive
integer n such that for every graph H of order n either H contains F or the comple-ment of H …
integer n such that for every graph H of order n either H contains F or the comple-ment of H …