Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The game chromatic number of a random hypergraph   We consider the following game, played on a $k$-uniform hypergraph $H$. There
are $q$ colors available and two players take it in turns to color vertices. A
partial coloring is proper if no edge is mono-chromatic. One player, A, wishes
to color all the vertices and the other player, B, wishes to prevent this. The
{\em game chromatic number} $\chi_g(H)$ is the minimum number of colors for
which A has a winning strategy. We consider this in the context of a random
$k$-uniform hypergraph and prove upper and lower bounds that hold w.h.p.

16
The categories of this paper are: stat
32
The categories of this paper are: atom-ph
37
The categories of this paper are: supr-con
34
The categories of this paper are: chem-ph
23
The categories of this paper are: solv-int
30
The categories of this paper are: q-alg
6
The categories of this paper are: astro-ph
35
The categories of this paper are: mtrl-th
31
The categories of this paper are: ao-sci
7
The categories of this paper are: hep-th
0
The categories of this paper are: hep-ph
18
The categories of this paper are: econ
27
The categories of this paper are: comp-gas
20
The categories of this paper are: acc-phys
12
The categories of this paper are: nucl-th
22
The categories of this paper are: chao-dyn