Alon -- Tarsi numbers of direct products
arXiv:2007.07140 · doi:10.2140/moscow.2021.10.271
Abstract
We provide a general framework on the coefficients of the graph polynomials of graphs which are Cartesian products. As a corollary, we prove that if is a graph with degrees of vertices , and the graph polynomial contains an "almost central" monomial (that means a monomial , where for all ), then the Cartesian product is -choosable.
the proof of the main theorem is simplified in ver. 2