On two generalizations of the Alon–Tarsi polynomial method

Abstract

In a seminal paper (Alon and Tarsi, 1992 [6]), Alon and Tarsi have introduced an algebraic technique for proving upper bounds on the choice number of graphs (and thus, in particular, upper bounds on their chromatic number). The upper bound on the choice number of G obtained via their method, was later coined the Alon–Tarsi number of G and was denoted by A T ( G ) (see e.g. Jensen and Toft (1995) [20]). They have provided a combinatorial interpretation of this parameter in terms of the eulerian subdigraphs of an appropriate orientation of G. Their characterization can be restated as follows. Let D be an orientation of G. Assign a weight ω D ( H ) to every subdigraph H of D: if H ⊆ D is eulerian, then ω D ( H ) = ( − 1 ) e ( H ) , otherwise ω D ( H ) = 0 . Alon and Tarsi proved that A T ( G ) ⩽ k if and only if there exists an orientation D of G in which the out-degree of every vertex is strictly less than k, and moreover ∑ H ⊆ D ω D ( H ) ≠ 0 . Shortly afterwards (Alon, 1993 [3]), for the special case of line graphs of d-regular d-edge-colorable graphs, Alon gave another interpretation of A T ( G ) , this time in terms of the signed d-colorings of the line graph. In this paper we generalize both results. The first characterization is generalized by showing that there is an infinite family of weight functions (which includes the one considered by Alon and Tarsi), each of which can be used to characterize A T ( G ) . The second characterization is generalized to all graphs (in fact the result is even more general—in particular it applies to hypergraphs). We then use the second generalization to prove that χ ( G ) = c h ( G ) = A T ( G ) holds for certain families of graphs G. Some of these results generalize certain known choosability results.