Add to ORKGIn this paper, we consider a variant of Ramsey numbers which we call complementary Ramsey numbers $\bR(m,t,s)$. We first establish their connections to pairs of Ramsey $(s,t)$-graphs. Using the classification of Ramsey $(s,t)$-graphs for small $s,t$, we determine the complementary Ramsey numbers $\bR(m,t,s)$ for $(s,t)=(4,4)$ and $(3,6)$
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
For given grafs G and H, The Ramsey number R(G,H) is the\ud smallest natural number n such that for ...
AbstractThe Ramsey number R(G1,G2) is the smallest integer p such that for any graph G on p vertices...
AbstractA new method of studying self-complementary graphs, called the decomposition method, is prop...
Abstract. We give exact values for certain small 2-colour Ramsey numbers in graphs. In particular, w...
AbstractWe present explicit constructions of three families of graphs that yield the following lower...
For two given graphs G and H, the Ramsey number R(G;H) is the smallest positive integer N such that ...
For two given graphs G and H, the Ramsey number R(G;H) is the smallest positive integer N such that ...
For two given graphs G and H, the Ramsey number R(G, H) is the smallest positive integer N such that...
AbstractA new method of studying self-complementary graphs, called the decomposition method, is prop...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
For two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer N such that for a...
For two given graphs G₁ and G₂, the Ramsey number R(G₁, G₂) is the smallest integer n such that for ...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that fo...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
For given grafs G and H, The Ramsey number R(G,H) is the\ud smallest natural number n such that for ...
AbstractThe Ramsey number R(G1,G2) is the smallest integer p such that for any graph G on p vertices...
AbstractA new method of studying self-complementary graphs, called the decomposition method, is prop...
Abstract. We give exact values for certain small 2-colour Ramsey numbers in graphs. In particular, w...
AbstractWe present explicit constructions of three families of graphs that yield the following lower...
For two given graphs G and H, the Ramsey number R(G;H) is the smallest positive integer N such that ...
For two given graphs G and H, the Ramsey number R(G;H) is the smallest positive integer N such that ...
For two given graphs G and H, the Ramsey number R(G, H) is the smallest positive integer N such that...
AbstractA new method of studying self-complementary graphs, called the decomposition method, is prop...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
For two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer N such that for a...
For two given graphs G₁ and G₂, the Ramsey number R(G₁, G₂) is the smallest integer n such that for ...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that fo...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
For given grafs G and H, The Ramsey number R(G,H) is the\ud smallest natural number n such that for ...
AbstractThe Ramsey number R(G1,G2) is the smallest integer p such that for any graph G on p vertices...