Add to ORKGThe cube graph Qn is the skeleton of the n-dimensional cube. It is an n-regular graph on 2n vertices. The Ramsey number r(Qn,Ks) is the minimum N such that every graph of order N contains the cube graph Qn or an independent set of order s. Burr and Erdős in 1983 asked whether the simple lower bound r(Qn,Ks) ≥ (s − 1)(2n − 1) + 1 is tight for s fixed and n sufficiently large. We make progress on this problem, obtaining the first upper bound which is within a constant factor of the lower bound.
For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that fo...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
The cube graph Q[subscript n] is the skeleton of the n-dimensional cube. It is an n-regular graph on...
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
The Ramsey number r(Ks,Qn) is the smallest positive integer N such that every red–blue colouring of ...
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a cop...
We divide our attention between two open problems. One of them is to find better lower bounds on Ram...
The Ramsey number r(K 3,Q n ) is the smallest integer N such that every red-blue colouring of the ed...
The Ramsey number r(K 3,Q n ) is the smallest integer N such that every red-blue colouring of the ed...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that fo...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertic...
The cube graph Q[subscript n] is the skeleton of the n-dimensional cube. It is an n-regular graph on...
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
The Ramsey number r(Ks,Qn) is the smallest positive integer N such that every red–blue colouring of ...
The Ramsey number R(F, H) is the minimum number N such that any N-vertex graph either contains a cop...
We divide our attention between two open problems. One of them is to find better lower bounds on Ram...
The Ramsey number r(K 3,Q n ) is the smallest integer N such that every red-blue colouring of the ed...
The Ramsey number r(K 3,Q n ) is the smallest integer N such that every red-blue colouring of the ed...
A graph with many vertices cannot be homogeneous, i.e., for any pair of integers (i,j) all large gra...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that fo...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
The Ramsey numbers for a graph G versus a graph H, denoted by R(G,H) is the smallest positive intege...