Problems on chromatic polynomials of hyper- graphs

Chromatic polynomials of graphs have been studied extensively for around one century. The concept of chromatic polynomial of a hypergraph is a natural extension of chromatic polynomial of a graph. It also has been studied for more than 30 years. This short article will focus on introducing some important open problems on chromatic polynomials of hypergraphs.


Introduction
A hypergraph H = (V, E) consists of two finite sets V and E, where E is a subset of {e ⊆ V : |e| ≥ 2}. A hypergraph is called Sperner hypergraph when no edge is a subset of another edge.
Erdös and Hajnal [14] first extended colourings on graphs to hypergraphs. For any integer λ ≥ 1, a proper λ-colouring of H is a mapping φ : V → {1, 2, · · · , λ} such that |{φ(v) : v ∈ e}| > 1 holds for each e ∈ E. Two proper λ-colourings φ and ψ of H are regarded as distinct if φ(u) = ψ(u) for some vertex u in H. Let P (H, λ) be the number of proper λ-colourings of H. This function P (H, λ) is called the chromatic polynomial of H, and it is indeed a polynomial in λ of degree |V |.
We have assumed that a hypergraph H has no loops. In the case that H has edges e 1 , e 2 with e 1 ⊆ e 2 , P (H, λ) = P (H − e 2 , λ) holds by the definition of P (H, λ), where H − e 2 is obtained from H by removing e 2 . Hence we can assume that H is Sperner in the function P (H, λ).
The graph-function P (H, λ) for a hypergraph H appeared in the work of Helgason [15] in 1972, but it is unknown if it had been mentioned earlier. It has been studied extensively in the past twenty years by many researches, such as Allagan [1,2,3], Borowiecki and Łazuka [5,6], Dohmen [8,9], Drgas-Burchardt and Łazuka [13], Tomescu [19,20,21,22,23] and Walter [24]. A number of properties of chromatic polynomials of graphs related to their expressions, computations and factorizations, etc, have been extended to chromatic polynomials of hypergraphs. In this short article, we will focus on introducing some important open problems in the study of chromatic polynomials of hypergraphs which are worth for further exploring.

Problems on chromatic polynomials of hypergraphs
A hypergraph H = (V, E) is said to be connected if for any two vertices u, v in H, H has a sequence of edges e 1 , e 2 , · · · , e k such that u ∈ e 1 , v ∈ e k and e i ∩ e i+1 = ∅ for all i = 1, 2, · · · , k − which has the property that e ⊆ V holds for all e ∈ E with e ∩ V = ∅.
Dohmen [8] and Tomescu [19] independently showed that P (H, λ) is a monic polynomial of degree |V |: where n = |V |, m = |E| and N (i, j) is the number of spanning sub-hypergraphs (V, E ), where E ⊆ E, with i components and j edges. Some properties on P (H, λ) can be obtained from (1). It is obvious that P (H, λ) is a monic polynomial with integral coefficients and has zero as its constant term. But the information on this polynomial from (1) or other results is far from enough to tell efficiently if a given polynomial is the chromatic polynomial of some hypergraph. It is natural to ask what polynomials are chromatic polynomials of hypergraphs.

Problem 1. Characterize chromatic polynomials of hypergraphs.
Two hypergraphs H 1 and H 2 are said to be isomorphic, denoted by A special case is on complete h-uniform hypergraphs. A hypergraph H = (V, E) is said to be complete h-uniform of order n, denoted by K n (h), if |V | = n and E = {e ⊆ V : |e| = h}.

Problem 3. For any integers
It is well known that for any graph G of order n, P (G, λ) can be expressed as c(G)≤i≤n a i λ i , where a i is a non-zero integer for all i with c(G) ≤ i ≤ n and c(G) is the number of components of G. In other words, P (G, λ) has the property that its terms with non-zero coefficients are consecutive. However, by (1), the property does not hold for a hypergraph H = (V, E) with h = min{|e| : e ∈ E} > 2, as the coefficient of the term λ n−i in the polynomial P (H, λ) is non-zero for i = h − 1 but is zero for all i with 1 ≤ i ≤ h − 2. It is also unknown if the rest terms λ n−i (i ≥ h − 1) with non-zero coefficients are consecutive. Thus it is natural to ask what terms in the polynomial P (H, λ) have non-zero coefficients. In particular, it is interesting to know what is the minimum integer r such that the term λ r in P (H, λ) has non-zero coefficient. By the property that P (H, λ) = 1≤i≤k P (H i , λ) whenever H 1 , · · · , H k are components of H, we can focus on connected hypergraphs for the above problem. It is known that the multiplicity of root '1' of P (G, λ) for a connected graph G is equal to the number of blocks of G. Is there an analogous result for hypergraphs? A hypergraph H = (V, E) is said to be separable if H has a vertex w and two proper subsets V 1 , V 2 of vertices such that V 1 ∩ V 2 = {w}, V 1 ∪ V 2 = V and for each e ∈ E, either w ∈ e or e ⊆ V i for some i. It is also known that if G is a graph of order n and P (G, λ) is the polynomial 1≤i≤n a i (G)λ i , then (−1) n−i a i (G) ≥ 0 holds for all i = 1, 2, · · · , n. This property implies that (−1) n P (G, λ) > 0 for all negative real numbers λ and thus (−∞, 0) is a zero-free interval for chromatic polynomials of graphs. Dohmen [9] showed that this above property holds for those hypergraphs H = (V, E) such that |e| is even for each e ∈ E and each cycle in H has an edge e with |e| = 2, where a cycle in H is a sequence (v 1 , e 1 , v 2 , e 2 , . . . , v k , e k ) of distinct vertices and edges such that v i , v i+1 ∈ e i for all i = 1, 2, · · · , k, where v k+1 = v 1 . But this property does not hold for all hypergraphs. Observe that if E = {V }, then P (H, λ) = λ |V | − λ, implying that P (H, λ) has negative real roots whenever |V | is odd. Thus (−∞, 0) is not a zero-free interval for chromatic polynomials of hypergraphs. However, it is unknown if there is a zero-free interval (a, b) with b ≤ 0 for chromatic polynomials of hypergraphs. Problem 6. Is there a zero-free interval for chromatic polynomials of hypergraphs? In particular, is there a zero-free interval (a, b) within some intervals (−∞, 0) or (0, 1)?
For any graph G of order n, we have the property that G has an n-colouring and P (G, λ) > 0 holds for all real λ > n − 1. For a hypergraph H = (V, E) with |V | = n and h = min{|e| : e ∈ E}, H has a (|V |−h+2)-colouring. But it is unknown if P (H, λ) > 0 holds for all real λ > |V |−h+1.
The shameful conjecture on chromatic polynomials of graphs was proposed by Bartels and Welsh [4] in 1995: for any graph G of order n, the following inequality holds: where e is the base of natural logarithms. This conjecture was finally proved by Dong [11] in 2000. Actually, Dong got a stronger result that, for any graph G of order n, the inequality P (G,λ) P (G,λ−1) ≥ λ n (λ−1) n holds for all real λ ≥ n. We guess this result can be extended to hypergraphs. Problem 8. Let H = (V, E) be a hypergraph with |V | = n. Does the following inequality Welsh in 1970s and Brenti [7] in 1992 conjectured that for any graph G, P (G, k) 2 ≥ P (G, k + 1)P (G, k − 1) holds for all integers k ≥ 1. However, Seymour [18] found some graphs G with sufficiently large order such that P (G, 6) 2 < P (G, 7)P (G, 5) holds. But it is still unknown if this conjecture holds for integers k ≥ n − 1. It has been proposed in [10] that P (G, λ) 2 ≥ P (G, λ + 1)P (G, λ − 1) holds for all real numbers λ ≥ |V (G)| − 1. We also believe that this conjecture also holds for hypergraphs. Problem 9. For any hypergraph H = (V, E) with |V | = n, does the following inequality P (H, λ) 2 ≥ P (H, λ − 1)P (H, λ + 1) holds for all real numbers λ ≥ n − 1?