English

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 G=(V,E)G=(V,E) is a graph with degrees of vertices 2d(v),vV2d(v), v\in V, and the graph polynomial (i,j)E(xjxi)\prod_{(i,j)\in E} (x_j-x_i) contains an "almost central" monomial (that means a monomial vxvcv\prod_v x_v^{c_v}, where cvd(v)1|c_v-d(v)|\leqslant 1 for all vVv\in V), then the Cartesian product GC2nG\square C_{2n} is (d()+2)(d(\cdot)+2)-choosable.

Keywords

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