The chromatic number of triangle-free hypergraphs
share
A triangle in a hypergraph ℋ is a set of three distinct edges e, f, g∈ℋ and three distinct vertices u, v, w∈ V(ℋ) such that {u, v}⊆ e, {v, w}⊆ f, {w, u}⊆ g and {u, v, w}∩ e∩ f∩ g=∅. Johansson proved in 1996 that χ(G)=𝒪(Δ/logΔ) for any triangle-free graph G with maximum degree Δ. Cooper and Mubayi later generalized the Johansson's theorem to all rank 3 hypergraphs. In this paper we provide a common generalization of both these results for all hypergraphs, showing that if ℋ is a rank k, triangle-free hypergraph, then the list chromatic number χ_ℓ(ℋ)≤𝒪(max_2≤ℓ≤ k{( Δ_ℓ/logΔ_ℓ)^1/ℓ-1}), where Δ_ℓ is the maximum ℓ-degree of ℋ. The result is sharp apart from the constant. Moreover, our result implies, generalizes and improves several earlier results on the chromatic number and also independence number of hypergraphs, while its proof is based on a different approach than prior works in hypergraphs (and therefore provides alternative proofs to them). In particular, as an application, we establish a bound on chromatic number of sparse hypergraphs in which each vertex is contained in few triangles, and thus extend results of Alon, Krivelevich and Sudakov, and Cooper and Mubayi from hypergraphs of rank 2 and 3, respectively, to all hypergraphs.
READ FULL TEXT