Add to ORKGSIGLETIB Hannover: RO 8278(89-014) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
ABSTRACr. Let G be a connected graph on n vertices with no more than n(1 + e) edges, and Pk or Ck a ...
SIGLEAvailable from British Library Document Supply Centre- DSC:D063026 / BLDSC - British Library Do...
For two given graphs G and H, the Ramsey number R(G;H) is the smallest positive integer N such that ...
For two givengraphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such that for an...
For two given graphs $F$ and $H$, the Ramsey number $R(F,H)$ is the smallest positive integer $p$ su...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
For two given graphs $F$ and $H$, the Ramsey number $R(F,H)$ is the smallest positive integer $p$ su...
The study of classical Ramsey numbers R(mn) shows little \ud progress in the last two decades. O...
For given graphs G and H, the Ramsey numberR(G,H) is the smallest positive integer n such that every...
The study of classical Ramsey numbers R(mn) shows little progress in the last two decades. Only nine...
For two graphs F1 and F2, the Ramsey number R(F1, F2) is the smallest positive integer r such that f...
For given grafs G and H, The Ramsey number R(G,H) is the\ud smallest natural number n such that for ...
AbstractGiven two graphs G1 and G2, denote by G1∗G2 the graph obtained from G1∪G2 by joining all the...
The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of pr...
For graphs G1 and G2, the set multipartite Ramsey number Mt(G1, G2) = j is the smallest integer such...
ABSTRACr. Let G be a connected graph on n vertices with no more than n(1 + e) edges, and Pk or Ck a ...
SIGLEAvailable from British Library Document Supply Centre- DSC:D063026 / BLDSC - British Library Do...
For two given graphs G and H, the Ramsey number R(G;H) is the smallest positive integer N such that ...
For two givengraphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such that for an...
For two given graphs $F$ and $H$, the Ramsey number $R(F,H)$ is the smallest positive integer $p$ su...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
For two given graphs $F$ and $H$, the Ramsey number $R(F,H)$ is the smallest positive integer $p$ su...
The study of classical Ramsey numbers R(mn) shows little \ud progress in the last two decades. O...
For given graphs G and H, the Ramsey numberR(G,H) is the smallest positive integer n such that every...
The study of classical Ramsey numbers R(mn) shows little progress in the last two decades. Only nine...
For two graphs F1 and F2, the Ramsey number R(F1, F2) is the smallest positive integer r such that f...
For given grafs G and H, The Ramsey number R(G,H) is the\ud smallest natural number n such that for ...
AbstractGiven two graphs G1 and G2, denote by G1∗G2 the graph obtained from G1∪G2 by joining all the...
The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of pr...
For graphs G1 and G2, the set multipartite Ramsey number Mt(G1, G2) = j is the smallest integer such...
ABSTRACr. Let G be a connected graph on n vertices with no more than n(1 + e) edges, and Pk or Ck a ...
SIGLEAvailable from British Library Document Supply Centre- DSC:D063026 / BLDSC - British Library Do...
For two given graphs G and H, the Ramsey number R(G;H) is the smallest positive integer N such that ...