Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Coloring d-Embeddable k-Uniform Hypergraphs   This paper extends the scenario of the Four Color Theorem in the following
way. Let H(d,k) be the set of all k-uniform hypergraphs that can be (linearly)
embedded into R^d. We investigate lower and upper bounds on the maximum (weak
and strong) chromatic number of hypergraphs in H(d,k). For example, we can
prove that for d>2 there are hypergraphs in H(2d-3,d) on n vertices whose weak
chromatic number is Omega(log n/log log n), whereas the weak chromatic number
for n-vertex hypergraphs in H(d,d) is bounded by O(n^((d-2)/(d-1))) for d>2.

23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci
21
The categories of this paper are: adap-org
20
The categories of this paper are: acc-phys
24
The categories of this paper are: dg-ga
19
The categories of this paper are: eess
4
The categories of this paper are: cond-mat
16
The categories of this paper are: stat
26
The categories of this paper are: bayes-an
1
The categories of this paper are: cs
32
The categories of this paper are: atom-ph
18
The categories of this paper are: econ
28
The categories of this paper are: alg-geom
34
The categories of this paper are: chem-ph
9
The categories of this paper are: nlin
17
The categories of this paper are: q-fin