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 H → kvG denote the fact that for every function π: V(H) → {1, …, k} there is an induced ...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
AbstractLet G be a graph with n vertices and m edges and let μ(G)=μ1(G)⩾⋯⩾μn(G) be the eigenvalues o...
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 ...
AbstractThe Ramsey number R(G) of a graph G is the least integer p such that for all bicolorings of ...
AbstractUpper bounds are found for the Ramsey function. We prove R(3, x) < cx2lnx and, for each k ⩾ ...
AbstractIt is shown that the order of magnitude of Ramsey number R(K3,Kn,n) is n2/logn as n→∞
AbstractThe main aim of the paper is to show that for 2⩽r<s and large enough n, there are graphs of ...
AbstractWe consider a class of graphs on n vertices, called (d, f)-arrangeable graphs. This class of...
Let f(n) be a function and L be a graph. Denote by RT(n, L, f(n)) the maximum number of edges of an ...
AbstractNew lower bounds for seven classical Ramsey numbers are obtained by considering some circula...
AbstractWei discovered that the stability number, α(G), of a graph, G, with degree sequence d1, d2,…...
AbstractLet G be a graph of order n and circumference c(G). Let G¯ be the complement of G. We prove ...
AbstractP. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp [P. Erdös, R.J. Faudree, C.C. Rousseau...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
AbstractLet H → kvG denote the fact that for every function π: V(H) → {1, …, k} there is an induced ...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
AbstractLet G be a graph with n vertices and m edges and let μ(G)=μ1(G)⩾⋯⩾μn(G) be the eigenvalues o...
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 ...
AbstractThe Ramsey number R(G) of a graph G is the least integer p such that for all bicolorings of ...
AbstractUpper bounds are found for the Ramsey function. We prove R(3, x) < cx2lnx and, for each k ⩾ ...
AbstractIt is shown that the order of magnitude of Ramsey number R(K3,Kn,n) is n2/logn as n→∞
AbstractThe main aim of the paper is to show that for 2⩽r<s and large enough n, there are graphs of ...
AbstractWe consider a class of graphs on n vertices, called (d, f)-arrangeable graphs. This class of...
Let f(n) be a function and L be a graph. Denote by RT(n, L, f(n)) the maximum number of edges of an ...
AbstractNew lower bounds for seven classical Ramsey numbers are obtained by considering some circula...
AbstractWei discovered that the stability number, α(G), of a graph, G, with degree sequence d1, d2,…...
AbstractLet G be a graph of order n and circumference c(G). Let G¯ be the complement of G. We prove ...
AbstractP. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp [P. Erdös, R.J. Faudree, C.C. Rousseau...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
AbstractLet H → kvG denote the fact that for every function π: V(H) → {1, …, k} there is an induced ...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
AbstractLet G be a graph with n vertices and m edges and let μ(G)=μ1(G)⩾⋯⩾μn(G) be the eigenvalues o...
DOI
Add to ORKG