Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Coloring sparse hypergraphs   Fix $k \geq 3$, and let $G$ be a $k$-uniform hypergraph with maximum degree
$\Delta$. Suppose that for each $l = 2, ..., k-1$, every set of l vertices of G
is in at most $\Delta^{(k-l)/(k-1)}/f$ edges. Then the chromatic number of $G$
is $O( (\Delta/\log f)^{1/(k-1)})$. This extends results of Frieze and the
second author and Bennett and Bohman. A similar result is proved for 3-uniform
hypergraphs where every vertex lies in few triangles. This generalizes a result
of Alon, Krivelevich, and Sudakov, who proved the result for graphs.
  Our main new technical contribution is a deviation inequality for positive
random variables with expectation less than 1. This may be of independent
interest and have further applications.

34
The categories of this paper are: chem-ph
37
The categories of this paper are: supr-con
24
The categories of this paper are: dg-ga
8
The categories of this paper are: hep-ex
7
The categories of this paper are: hep-th
32
The categories of this paper are: atom-ph
11
The categories of this paper are: hep-lat
16
The categories of this paper are: stat
15
The categories of this paper are: nucl-ex
22
The categories of this paper are: chao-dyn
1
The categories of this paper are: cs
0
The categories of this paper are: hep-ph
3
The categories of this paper are: physics
29
The categories of this paper are: funct-an
14
The categories of this paper are: math-ph
6
The categories of this paper are: astro-ph