Alon -- Tarsi numbers of direct products
Combinatorics
2022-01-19 v3
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.
Cite
@article{arxiv.2007.07140,
title = {Alon -- Tarsi numbers of direct products},
author = {Alexey Gordeev and Fedor Petrov},
journal= {arXiv preprint arXiv:2007.07140},
year = {2022}
}
Comments
the proof of the main theorem is simplified in ver. 2