AbstractIt is shown that a graph of orderNand average degreedthat does not contain the bookBm=K1+K1, mas a subgraph has independence number at leastNf(d), wheref(x)∼(logx/x)(x→∞). From this result we find that the book-complete graph Ramsey number satisfiesr(Bm, Kn)⩽mn2/log(n/e). It is also shown that for every treeTmwithmedges,r(K1+Tm,Kn)⩽(2m−1)n2/log(n/e)
For any graph class G of any two positive integers i and j, the Ramsey number RG(i, j) is the smalle...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
AbstractWe present a simple explicit construction, in terms of t, of a graph that is triangle-free, ...
AbstractThe Ramsey number r(H,Kn) is the smallest integer N so that each graph on N vertices that fa...
Let k ≥ 5 be a fixed integer and let m = ⌊(k - 1)/2⌋. It is shown that the independence number of a ...
The cycle-complete graph Ramsey number r(Cₘ,Kₙ) is the smallest integer N such that every graph G of...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
AbstractGiven two graphs G1 and G2, denote by G1∗G2 the graph obtained from G1∪G2 by joining all the...
We show that for any graph G with N vertices and average degree d, if the average degree of any neig...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
Abstract. For given graphs G and H, the Ramsey number R(G,H)\ud is the smallest natural number n suc...
AbstractFor given graphs G and H, the Ramsey number R(G,H) is the smallest natural number n such tha...
AbstractFor a positive integer n and graph B, fB(n) is the least integer m such that any graph of or...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
The cycle-complete graph Ramsey number r(Cm;Kn) is the smallest integer N such that every graph G of...
For any graph class G of any two positive integers i and j, the Ramsey number RG(i, j) is the smalle...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
AbstractWe present a simple explicit construction, in terms of t, of a graph that is triangle-free, ...
AbstractThe Ramsey number r(H,Kn) is the smallest integer N so that each graph on N vertices that fa...
Let k ≥ 5 be a fixed integer and let m = ⌊(k - 1)/2⌋. It is shown that the independence number of a ...
The cycle-complete graph Ramsey number r(Cₘ,Kₙ) is the smallest integer N such that every graph G of...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
AbstractGiven two graphs G1 and G2, denote by G1∗G2 the graph obtained from G1∪G2 by joining all the...
We show that for any graph G with N vertices and average degree d, if the average degree of any neig...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
Abstract. For given graphs G and H, the Ramsey number R(G,H)\ud is the smallest natural number n suc...
AbstractFor given graphs G and H, the Ramsey number R(G,H) is the smallest natural number n such tha...
AbstractFor a positive integer n and graph B, fB(n) is the least integer m such that any graph of or...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
The cycle-complete graph Ramsey number r(Cm;Kn) is the smallest integer N such that every graph G of...
For any graph class G of any two positive integers i and j, the Ramsey number RG(i, j) is the smalle...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
AbstractWe present a simple explicit construction, in terms of t, of a graph that is triangle-free, ...
DOI
Add to ORKG