Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On efficient constructions of short lists containing mostly Ramsey
  graphs   One of the earliest and best-known application of the probabilistic method is
the proof of existence of a 2 log n$-Ramsey graph, i.e., a graph with n nodes
that contains no clique or independent set of size 2 log n. The explicit
construction of such a graph is a major open problem. We show that a reasonable
hardness assumption implies that in polynomial time one can construct a list
containing polylog(n) graphs such that most of them are 2 log n-Ramsey.

24
The categories of this paper are: dg-ga
17
The categories of this paper are: q-fin
14
The categories of this paper are: math-ph
11
The categories of this paper are: hep-lat
20
The categories of this paper are: acc-phys
18
The categories of this paper are: econ
9
The categories of this paper are: nlin
27
The categories of this paper are: comp-gas
36
The categories of this paper are: cmp-lg
21
The categories of this paper are: adap-org
15
The categories of this paper are: nucl-ex
33
The categories of this paper are: plasm-ph
4
The categories of this paper are: cond-mat
2
The categories of this paper are: math
0
The categories of this paper are: hep-ph
25
The categories of this paper are: patt-sol