AbstractThe Ramsey number R(Cn, Km) is the smallest integer p such that any graph G on p vertices either contains a cycleCn with length n or contains an independent set with order m. In this paper we prove that R(Cn, K5) = 4(n− 1) + 1 (n= 6, 7)
The Ramsey number R(C4, Km) is the smallest n such that any graph on n vertices contains a cycle of ...
For two given graphs G and H, the Ramsey number R(G, H) is the smallest positive integer N such that...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
is the smallest integer n such that for any graph G of order n, either G contains G1 or the compleme...
Abstract: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
For two given graphs G₁ and G₂, the Ramsey number R(G₁, G₂) is the smallest integer n such that for ...
The cycle-complete graph Ramsey number r(Cₘ,Kₙ) is the smallest integer N such that every graph G of...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
For given graphs G and H, the Ramsey numberR(G,H) is the smallest positive integer n such that every...
The cycle-complete graph Ramsey number r(Cm;Kn) is the smallest integer N such that every graph G of...
The Ramsey number R(C4,Km) is the smallest n such that any graph on n vertices contains a cycle of l...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
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 ...
The Ramsey number R(C4, Km) is the smallest n such that any graph on n vertices contains a cycle of ...
For two given graphs G and H, the Ramsey number R(G, H) is the smallest positive integer N such that...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
is the smallest integer n such that for any graph G of order n, either G contains G1 or the compleme...
Abstract: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
For two given graphs G₁ and G₂, the Ramsey number R(G₁, G₂) is the smallest integer n such that for ...
The cycle-complete graph Ramsey number r(Cₘ,Kₙ) is the smallest integer N such that every graph G of...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
For given graphs G and H, the Ramsey numberR(G,H) is the smallest positive integer n such that every...
The cycle-complete graph Ramsey number r(Cm;Kn) is the smallest integer N such that every graph G of...
The Ramsey number R(C4,Km) is the smallest n such that any graph on n vertices contains a cycle of l...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
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 ...
The Ramsey number R(C4, Km) is the smallest n such that any graph on n vertices contains a cycle of ...
For two given graphs G and H, the Ramsey number R(G, H) is the smallest positive integer N such that...
AbstractFor two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer n such th...
DOI
Add to ORKG