DOIAbstract
AbstractLet integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors. Using an algebraic construction it is shown that rk(Km,n)≥km(n−n0.525) for large n
AbstractLet integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors. Using an algebraic construction it is shown that rk(Km,n)≥km(n−n0.525) for large n
AbstractIt is shown that for any graph H of order m, nm+13(2mlogn)m<r(H+Kn,Kn)<nm+1log(ne) for all s...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
Ramsey Theory states that there exists a Ramsey Number. This number is the minimum number of nodes n...
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...
AbstractLet G and H be graphs. Results are given which, in principle, permit the Ramsey numbers r(G,...
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
AbstractLet G be a fixed finite set of connected graphs. Results are given which, in principle, perm...
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a cop...
AbstractGiven two graphs G1 and G2, denote by G1∗G2 the graph obtained from G1∪G2 by joining all the...
AbstractThe Ramsey number M(p,q) is the greatest integer such that for each n<M(p,q), it is possible...
This MSc thesis deals with a theory, which comes from combinatorics. According to Ramsey's theorem f...
AbstractThe Ramsey number of a graph G is the least number t for which it is true that whenever the ...
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the ...
AbstractIt is shown that for any graph H of order m, nm+13(2mlogn)m<r(H+Kn,Kn)<nm+1log(ne) for all s...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
Ramsey Theory states that there exists a Ramsey Number. This number is the minimum number of nodes n...
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...
AbstractLet G and H be graphs. Results are given which, in principle, permit the Ramsey numbers r(G,...
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
AbstractLet G be a fixed finite set of connected graphs. Results are given which, in principle, perm...
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a cop...
AbstractGiven two graphs G1 and G2, denote by G1∗G2 the graph obtained from G1∪G2 by joining all the...
AbstractThe Ramsey number M(p,q) is the greatest integer such that for each n<M(p,q), it is possible...
This MSc thesis deals with a theory, which comes from combinatorics. According to Ramsey's theorem f...
AbstractThe Ramsey number of a graph G is the least number t for which it is true that whenever the ...
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the ...
AbstractIt is shown that for any graph H of order m, nm+13(2mlogn)m<r(H+Kn,Kn)<nm+1log(ne) for all s...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
Ramsey Theory states that there exists a Ramsey Number. This number is the minimum number of nodes n...
Add to ORKG