DOIAbstract
AbstractLet F be a graph of order v(F)≥3 and size e(F), and let ρ(F)=(e(F)−1)/(v(F)−2). It is shown that if Gn is a graph of order n with average degree dn≥2, then r(F,Gn)≥c(dnlogdn)ρ(F) for all n, where c=c(F)>0 is a constant
AbstractLet F be a graph of order v(F)≥3 and size e(F), and let ρ(F)=(e(F)−1)/(v(F)−2). It is shown that if Gn is a graph of order n with average degree dn≥2, then r(F,Gn)≥c(dnlogdn)ρ(F) for all n, where c=c(F)>0 is a constant
We consider a class of graphs on n vertices, called (d, f)-arrangeable graphs. This class of graphs ...
We consider a class of graphs on n vertices, called (d, f)-arrangeable graphs. This class of graphs ...
AbstractSome connections between strongly regular graphs and finite Ramsey theory are drawn. Let Bn ...
AbstractWe prove that for any fixed integer m⩾3 and constants δ>0 and α⩾0, if F is a graph on m vert...
AbstractLet F be a graph of order v(F)≥3 and size e(F), and let ρ(F)=(e(F)−1)/(v(F)−2). It is shown ...
We prove that for any fixed integer m ≥ 3 and constants δ > 0 and α ≥ 0, if F is a graph on m vertic...
AbstractLet G and H be graphs. Results are given which, in principle, permit the Ramsey numbers r(G,...
AbstractLet integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors....
For fixed integers m,k≥2, it is shown that the k-color Ramsey number rk(Km,n) and the bipartite Rams...
AbstractLet G be a fixed finite set of connected graphs. Results are given which, in principle, perm...
AbstractFor fixed integers m,k⩾2, it is shown that the k-color Ramsey number rk(Km,n) and the bipart...
AbstractAn induced subgraph is called homogeneous if it is either a clique or an independent set. Le...
AbstractLet br(H1,H2) be the bipartite Ramsey number for bipartite graphs H1 and H2. It is shown tha...
AbstractLet G1,…,Gc be graphs and let H be a connected graph. Let Hn be a graph on n points which is...
AbstractFor a positive integer n and graph B, fB(n) is the least integer m such that any graph of or...
We consider a class of graphs on n vertices, called (d, f)-arrangeable graphs. This class of graphs ...
We consider a class of graphs on n vertices, called (d, f)-arrangeable graphs. This class of graphs ...
AbstractSome connections between strongly regular graphs and finite Ramsey theory are drawn. Let Bn ...
AbstractWe prove that for any fixed integer m⩾3 and constants δ>0 and α⩾0, if F is a graph on m vert...
AbstractLet F be a graph of order v(F)≥3 and size e(F), and let ρ(F)=(e(F)−1)/(v(F)−2). It is shown ...
We prove that for any fixed integer m ≥ 3 and constants δ > 0 and α ≥ 0, if F is a graph on m vertic...
AbstractLet G and H be graphs. Results are given which, in principle, permit the Ramsey numbers r(G,...
AbstractLet integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors....
For fixed integers m,k≥2, it is shown that the k-color Ramsey number rk(Km,n) and the bipartite Rams...
AbstractLet G be a fixed finite set of connected graphs. Results are given which, in principle, perm...
AbstractFor fixed integers m,k⩾2, it is shown that the k-color Ramsey number rk(Km,n) and the bipart...
AbstractAn induced subgraph is called homogeneous if it is either a clique or an independent set. Le...
AbstractLet br(H1,H2) be the bipartite Ramsey number for bipartite graphs H1 and H2. It is shown tha...
AbstractLet G1,…,Gc be graphs and let H be a connected graph. Let Hn be a graph on n points which is...
AbstractFor a positive integer n and graph B, fB(n) is the least integer m such that any graph of or...
We consider a class of graphs on n vertices, called (d, f)-arrangeable graphs. This class of graphs ...
We consider a class of graphs on n vertices, called (d, f)-arrangeable graphs. This class of graphs ...
AbstractSome connections between strongly regular graphs and finite Ramsey theory are drawn. Let Bn ...
Add to ORKG