Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An improved method for recursively computing upper bounds for two-colour
  Ramsey numbers   The two-colour Ramsey number $R(m,n)$ is the least natural number $p$ such
that any graph of order $p$ must contain either a clique of size $m$ or an
independent set of size $n$. We exhibit a method for computing upper bounds for
$R(m,n)$ recursively, using known upper bounds of $R(\cdot,\cdot)$ with lower
values for at least one of the arguments. We also give an example of how this
method could be used to improve several of the best known bounds that are
available in the literature (which however soon will be obsolete due to a
forthcoming work).

5
The categories of this paper are: gr-qc
24
The categories of this paper are: dg-ga
1
The categories of this paper are: cs
36
The categories of this paper are: cmp-lg
7
The categories of this paper are: hep-th
13
The categories of this paper are: quant-ph
20
The categories of this paper are: acc-phys
11
The categories of this paper are: hep-lat
37
The categories of this paper are: supr-con
29
The categories of this paper are: funct-an
12
The categories of this paper are: nucl-th
9
The categories of this paper are: nlin
3
The categories of this paper are: physics
28
The categories of this paper are: alg-geom
16
The categories of this paper are: stat
34
The categories of this paper are: chem-ph