Let G″be a graph obtained from G by deleting two vertices. It is shown that r(G, H) ≤A+B+2+2√(A 2+ AB+ B 2)/3, where A = r(G″, H) and B = r(G, H″). © 2004 Elsevier Ltd. All rights reserved.link_to_subscribed_fulltex
Using computational techniques we derive six new upper bounds on the classical two
For given graphs G and H, the Ramsey numberR(G,H) is the smallest positive integer n such that every...
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a cop...
AbstractLet G″ be a graph obtained from G by deleting two vertices. It is shown that r(G, H) ⩽ A + B...
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
For any pair of graphs G and H, both the size Ramsey number ̂r(G,H) and the restricted size Ramsey n...
AbstractThe Ramsey number R(G1,G2) is the smallest integer p such that for any graph G on p vertices...
AbstractWe present explicit constructions of three families of graphs that yield the following lower...
AbstractWe consider the numbers associated with Ramsey's theorem as it pertains to partitions of the...
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the ...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
AbstractIt is proved that M(5, 4) ⩽ 28 and M(5, 5) ⩽ 55. New upper bounds are also given for M(6, 4)...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
AbstractThe Ramsey number r(H,G) is defined as the minimum N such that for any coloring of the edges...
Using computational techniques we derive six new upper bounds on the classical two
For given graphs G and H, the Ramsey numberR(G,H) is the smallest positive integer n such that every...
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a cop...
AbstractLet G″ be a graph obtained from G by deleting two vertices. It is shown that r(G, H) ⩽ A + B...
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
For any pair of graphs G and H, both the size Ramsey number ̂r(G,H) and the restricted size Ramsey n...
AbstractThe Ramsey number R(G1,G2) is the smallest integer p such that for any graph G on p vertices...
AbstractWe present explicit constructions of three families of graphs that yield the following lower...
AbstractWe consider the numbers associated with Ramsey's theorem as it pertains to partitions of the...
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the ...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
AbstractIt is proved that M(5, 4) ⩽ 28 and M(5, 5) ⩽ 55. New upper bounds are also given for M(6, 4)...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
AbstractThe Ramsey number r(H,G) is defined as the minimum N such that for any coloring of the edges...
Using computational techniques we derive six new upper bounds on the classical two
For given graphs G and H, the Ramsey numberR(G,H) is the smallest positive integer n such that every...
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a cop...
DOI
Add to ORKG