AbstractLet G1,…,Gc be graphs and let H be a connected graph. Let Hn be a graph on n points which is homeomorphic to H. It is proved that if n is large enough, the Ramsey number r(G1,…,Gc,Hn) has the form (X−1)(n−1)+T. Here X and T are two Ramsey-type functons involving G1,…,Gc only. The properties of these functions are studied, leading to explicit evaluations in a number of cases
For any two-colouring of the segments determined by 3n-3 points in general position in the plane, ei...
Let G1, G2,..., Gt be graphs. The multicolor Ramsey number R(G1, G2,..., Gt) is the smallest positiv...
For two given graphs G and H, the Ramsey number R(G,H) is the smallest positive integer p such that ...
AbstractFor fixed integers m,k⩾2, it is shown that the k-color Ramsey number rk(Km,n) and the bipart...
For fixed integers m,k≥2, it is shown that the k-color Ramsey number rk(Km,n) and the bipartite Rams...
AbstractThe ramsey number of a connected nonbipartite graph G with a sufficiently long path emanatin...
AbstractLet G and H be graphs. Results are given which, in principle, permit the Ramsey numbers r(G,...
We give the multicolor Ramsey number for some graphs with a path or a cycle in the given sequence, g...
AbstractLet integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors....
Given a positive integer s, a graph G is s-Ramsey for a graph H, denoted G→(H)s, if every s-colourin...
AbstractLet F be a graph of order v(F)≥3 and size e(F), and let ρ(F)=(e(F)−1)/(v(F)−2). It is shown ...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
htmlabstractFor any two-colouring of the segments determined by 3n-3 points in general position in t...
For any two-colouring of the segments determined by 3n-3 points in general position in the plane, ei...
For any two-colouring of the segments determined by 3n-3 points in general position in the plane, ei...
For any two-colouring of the segments determined by 3n-3 points in general position in the plane, ei...
Let G1, G2,..., Gt be graphs. The multicolor Ramsey number R(G1, G2,..., Gt) is the smallest positiv...
For two given graphs G and H, the Ramsey number R(G,H) is the smallest positive integer p such that ...
AbstractFor fixed integers m,k⩾2, it is shown that the k-color Ramsey number rk(Km,n) and the bipart...
For fixed integers m,k≥2, it is shown that the k-color Ramsey number rk(Km,n) and the bipartite Rams...
AbstractThe ramsey number of a connected nonbipartite graph G with a sufficiently long path emanatin...
AbstractLet G and H be graphs. Results are given which, in principle, permit the Ramsey numbers r(G,...
We give the multicolor Ramsey number for some graphs with a path or a cycle in the given sequence, g...
AbstractLet integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors....
Given a positive integer s, a graph G is s-Ramsey for a graph H, denoted G→(H)s, if every s-colourin...
AbstractLet F be a graph of order v(F)≥3 and size e(F), and let ρ(F)=(e(F)−1)/(v(F)−2). It is shown ...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
htmlabstractFor any two-colouring of the segments determined by 3n-3 points in general position in t...
For any two-colouring of the segments determined by 3n-3 points in general position in the plane, ei...
For any two-colouring of the segments determined by 3n-3 points in general position in the plane, ei...
For any two-colouring of the segments determined by 3n-3 points in general position in the plane, ei...
Let G1, G2,..., Gt be graphs. The multicolor Ramsey number R(G1, G2,..., Gt) is the smallest positiv...
For two given graphs G and H, the Ramsey number R(G,H) is the smallest positive integer p such that ...
DOI
Add to ORKG