In this paper, we study the upper size Ramsey number u(G1,G2)u(G1,G2), defined by Erdős and Faudree, as well as the star-critical Ramsey number r∗(G1,G2)r∗(G1,G2), defined by Hook and Isaak. We define Ramsey-full graphs and size Ramsey good graphs, and perform a detailed study on these graphs. We generalize earlier results by determining u(nKk,mKl)u(nKk,mKl) and r∗(nKk,mKl)r∗(nKk,mKl) for k,l≥3k,l≥3 and large m,nm,n; u(Cn,Cm)u(Cn,Cm) for mm odd, with n>m≥3n>m≥3; and r∗(Cn,Cm)r∗(Cn,Cm) for mm odd, with n≥m≥3n≥m≥3 and (m,n)≠(3,3)(m,n)≠(3,3)
對於圖 G_1, G_2, ..., G_r和 F,如果當 F的邊被著上 1, 2, ..., r這些顏色時,總是存在 i使得著顏色 i的邊中包含圖 G_$的話,則記作 F -> (G_1, G_2,...
Given two graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer N such that, for any ...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest positive integer ...
In this paper, we study the upper size Ramsey number u(G1,G2)u(G1,G2), defined by Erdős and Faudree,...
AbstractThe graph Ramsey number R(G,H) is the smallest integer r such that every 2-coloring of the e...
Given three graphs G, H and K we write K → (G, H), if in any red/blue coloring of the edges of K the...
The graph Ramsey number R(G,H) is the smallest integer r such that every 2-coloring of the edges of ...
AbstractWe calculate some size Ramsey numbers involving stars. For example we prove that for t ⩾ k ⩾...
The star-critical Ramsey number r∗(H1, H2) is the smallest integer k such that every red/blue colori...
AbstractFor given two graphs G1 and G2, and integer j ≥ 2, the size multipartite Ramsey numbers mj(G...
Given three graphs G, H and K we write K → (G, H), if in any red/blue coloring of the edges of K the...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
Given two graphs G1 and G2, the Ramsey number R(G1,G2) is the\ud smallest integer N such that, for a...
AbstractThe double star S(n, m), where n ⩾ m ⩾ 0, is the graph consisting of the union of two stars ...
Ramsey Theory, one of the most well-studied branches of Combinatorics, can be paraphrased as the pur...
對於圖 G_1, G_2, ..., G_r和 F,如果當 F的邊被著上 1, 2, ..., r這些顏色時,總是存在 i使得著顏色 i的邊中包含圖 G_$的話,則記作 F -> (G_1, G_2,...
Given two graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer N such that, for any ...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest positive integer ...
In this paper, we study the upper size Ramsey number u(G1,G2)u(G1,G2), defined by Erdős and Faudree,...
AbstractThe graph Ramsey number R(G,H) is the smallest integer r such that every 2-coloring of the e...
Given three graphs G, H and K we write K → (G, H), if in any red/blue coloring of the edges of K the...
The graph Ramsey number R(G,H) is the smallest integer r such that every 2-coloring of the edges of ...
AbstractWe calculate some size Ramsey numbers involving stars. For example we prove that for t ⩾ k ⩾...
The star-critical Ramsey number r∗(H1, H2) is the smallest integer k such that every red/blue colori...
AbstractFor given two graphs G1 and G2, and integer j ≥ 2, the size multipartite Ramsey numbers mj(G...
Given three graphs G, H and K we write K → (G, H), if in any red/blue coloring of the edges of K the...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
Given two graphs G1 and G2, the Ramsey number R(G1,G2) is the\ud smallest integer N such that, for a...
AbstractThe double star S(n, m), where n ⩾ m ⩾ 0, is the graph consisting of the union of two stars ...
Ramsey Theory, one of the most well-studied branches of Combinatorics, can be paraphrased as the pur...
對於圖 G_1, G_2, ..., G_r和 F,如果當 F的邊被著上 1, 2, ..., r這些顏色時,總是存在 i使得著顏色 i的邊中包含圖 G_$的話,則記作 F -> (G_1, G_2,...
Given two graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer N such that, for any ...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest positive integer ...