DOIAbstract
AbstractIt is shown that the order of magnitude of the k-color Ramsey numbers rk(C2m) is km/(m−1) for m=2,3,5 as k→∞
AbstractIt is shown that the order of magnitude of the k-color Ramsey numbers rk(C2m) is km/(m−1) for m=2,3,5 as k→∞
Establishing the values of Ramsey numbers is, in general, a difficult task from the computational po...
AbstractThe multicolor Ramsey number rk(C4) is the smallest integer n for which any k-coloring of th...
The Ramsey number r(H) of a graph H is the minimum n such that any two-coloring of the edges of the ...
AbstractIt is shown that the order of magnitude of Ramsey number R(K3,Kn,n) is n2/logn as n→∞
For fixed integers m,k≥2, it is shown that the k-color Ramsey number rk(Km,n) and the bipartite Rams...
AbstractFor fixed integers m,k⩾2, it is shown that the k-color Ramsey number rk(Km,n) and the bipart...
For a graph L and an integer k≥2, Rk(L) denotes the smallest integer N for which for any edge-colori...
For a graph L and an integer k≥2, Rk(L) denotes the smallest integer N for which for any edge-colori...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;不具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gat...
Ramsey theory has to do with order within disorder. This thesis studies two Ramsey numbers, R(3; 3) ...
Ramsey theory has to do with order within disorder. This thesis studies two Ramsey numbers, R(3; 3) ...
We study the multicolor Ramsey numbers for paths and even cycles, Rk(Pn) and Rk(Cn), which are the s...
We give the multicolor Ramsey number for some graphs with a path or a cycle in the given sequence, g...
For simple graphs $G_1$ and $G_2$, the size Ramsey multipartite number $m_j(G_1, G_2)$ is defined as...
The Ramsey number R(Cp, Cq, Cr) is the smallest positive integer m such that no matter how one color...
Establishing the values of Ramsey numbers is, in general, a difficult task from the computational po...
AbstractThe multicolor Ramsey number rk(C4) is the smallest integer n for which any k-coloring of th...
The Ramsey number r(H) of a graph H is the minimum n such that any two-coloring of the edges of the ...
AbstractIt is shown that the order of magnitude of Ramsey number R(K3,Kn,n) is n2/logn as n→∞
For fixed integers m,k≥2, it is shown that the k-color Ramsey number rk(Km,n) and the bipartite Rams...
AbstractFor fixed integers m,k⩾2, it is shown that the k-color Ramsey number rk(Km,n) and the bipart...
For a graph L and an integer k≥2, Rk(L) denotes the smallest integer N for which for any edge-colori...
For a graph L and an integer k≥2, Rk(L) denotes the smallest integer N for which for any edge-colori...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;不具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gat...
Ramsey theory has to do with order within disorder. This thesis studies two Ramsey numbers, R(3; 3) ...
Ramsey theory has to do with order within disorder. This thesis studies two Ramsey numbers, R(3; 3) ...
We study the multicolor Ramsey numbers for paths and even cycles, Rk(Pn) and Rk(Cn), which are the s...
We give the multicolor Ramsey number for some graphs with a path or a cycle in the given sequence, g...
For simple graphs $G_1$ and $G_2$, the size Ramsey multipartite number $m_j(G_1, G_2)$ is defined as...
The Ramsey number R(Cp, Cq, Cr) is the smallest positive integer m such that no matter how one color...
Establishing the values of Ramsey numbers is, in general, a difficult task from the computational po...
AbstractThe multicolor Ramsey number rk(C4) is the smallest integer n for which any k-coloring of th...
The Ramsey number r(H) of a graph H is the minimum n such that any two-coloring of the edges of the ...
Add to ORKG