Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Equitable coloring of k-uniform hypergraphs   Let $H$ be a $k$-uniform hypergraph with $n$ vertices. A {\em strong
$r$-coloring} is a partition of the vertices into $r$ parts, such that each
edge of $H$ intersects each part. A strong $r$-coloring is called {\em
equitable} if the size of each part is $\lceil n/r \rceil$ or $\lfloor n/r
\rfloor$. We prove that for all $a \geq 1$, if the maximum degree of $H$
satisfies $\Delta(H) \leq k^a$ then $H$ has an equitable coloring with
$\frac{k}{a \ln k}(1-o_k(1))$ parts. In particular, every $k$-uniform
hypergraph with maximum degree $O(k)$ has an equitable coloring with
$\frac{k}{\ln k}(1-o_k(1))$ parts. The result is asymptotically tight. The
proof uses a double application of the non-symmetric version of the Lov\'asz
Local Lemma.

0
The categories of this paper are: hep-ph
7
The categories of this paper are: hep-th
21
The categories of this paper are: adap-org
13
The categories of this paper are: quant-ph
6
The categories of this paper are: astro-ph
10
The categories of this paper are: q-bio
26
The categories of this paper are: bayes-an
15
The categories of this paper are: nucl-ex
1
The categories of this paper are: cs
32
The categories of this paper are: atom-ph
36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
25
The categories of this paper are: patt-sol
29
The categories of this paper are: funct-an
3
The categories of this paper are: physics
17
The categories of this paper are: q-fin